The following pages link to Stony Brook (Q17180):
Displaying 50 items.
- Homotopy continuation method for solving systems of nonlinear and polynomial equations (Q268822) (← links)
- Weak bisimulations for fuzzy automata (Q279375) (← links)
- Parallel computations on a graph (Q300314) (← links)
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- An obstruction to solvability of the reach control problem using affine feedback (Q313222) (← links)
- On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra (Q328226) (← links)
- Fast point and element search method in adaptive remeshing procedure and its applications (Q420199) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- A note on testing axioms of revealed preference (Q495751) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Mixed cell computation in HOM4ps (Q507160) (← links)
- Parallel degree computation for binomial systems (Q507161) (← links)
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (Q507359) (← links)
- Monte Carlo solution of combinatorial optimization problems (Q521436) (← links)
- Design tools for reporter strands and DNA origami scaffold strands (Q529038) (← links)
- A localized approach for the method of approximate particular solutions (Q639043) (← links)
- Polynomial approximations of electronic wave functions (Q645167) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Greedy algorithms for the minimization knapsack problem: average behavior (Q733910) (← links)
- Tensors, matchings and codes (Q765171) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- Approximating a real number by a rational number with a limited denominator: a geometric approach (Q967407) (← links)
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks (Q1626857) (← links)
- Localized method of approximate particular solutions with polynomial basis functions (Q1634532) (← links)
- Approximations of arbitrary relations by partial orders (Q1644912) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- Model reduction of distributed nonstationary LPV systems (Q1663015) (← links)
- Timed runtime monitoring for multiparty conversations (Q1682289) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- Median filtering: a new insight (Q1707996) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- Anytime coalition structure generation in multi-agent systems with positive or negative externalities (Q1761282) (← links)
- Wavelet deblurring algorithms for spatially varying blur from high-resolution image reconstruction (Q1874664) (← links)
- Network DEA: efficiency analysis of organizations with complex internal structure (Q1883891) (← links)
- MudPie: layers in the ball of mud (Q1887720) (← links)
- Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems (Q1954471) (← links)
- Quality analysis in acyclic production networks (Q2009806) (← links)
- Confluence up to garbage in graph transformation (Q2049983) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Explicit physics-informed neural networks for nonlinear closure: the case of transport in tissues (Q2136464) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Fast three-valued abstract bit-vector arithmetic (Q2152654) (← links)
- Exact and meta-heuristic approaches for the production leveling problem (Q2163752) (← links)
- On the reliability of structures equipped with a class of friction-based devices under stochastic excitation (Q2180486) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Optimal design of electromagnetic devices: development of an efficient optimization tool based on smart mutation operations implemented in a genetic algorithm (Q2227388) (← links)
