Stony Brook
From MaRDI portal
Software:17180
No author found.
Related Items (only showing first 100 items - show all)
Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency ⋮ Homotopy continuation method for solving systems of nonlinear and polynomial equations ⋮ Wavelet deblurring algorithms for spatially varying blur from high-resolution image reconstruction ⋮ Weak bisimulations for fuzzy automata ⋮ Tensors in computations ⋮ Optimisation for multi-part flow-line configuration of reconfigurable manufacturing system using GA ⋮ Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms ⋮ Network DEA: efficiency analysis of organizations with complex internal structure ⋮ A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks ⋮ MudPie: layers in the ball of mud ⋮ Explicit physics-informed neural networks for nonlinear closure: the case of transport in tissues ⋮ Parallel computations on a graph ⋮ Multilevel approaches for large-scale proteomic networks ⋮ Localized method of approximate particular solutions with polynomial basis functions ⋮ An efficient method to evaluate intersections on big data sets ⋮ An obstruction to solvability of the reach control problem using affine feedback ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Practical distribution-sensitive point location in triangulations ⋮ Rank-Balanced Trees ⋮ Approximations of arbitrary relations by partial orders ⋮ On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra ⋮ Fast three-valued abstract bit-vector arithmetic ⋮ How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results ⋮ Searching for quicksand ideals in partially ordered sets ⋮ Exact and meta-heuristic approaches for the production leveling problem ⋮ Power measures and solutions for games under precedence constraints ⋮ Unnamed Item ⋮ Model reduction of distributed nonstationary LPV systems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ On kernelization and approximation for the vector connectivity problem ⋮ On the reliability of structures equipped with a class of friction-based devices under stochastic excitation ⋮ A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C ⋮ Timed runtime monitoring for multiparty conversations ⋮ Identifying codes on directed de Bruijn graphs ⋮ Resource allocation for epidemic control across multiple sub-populations ⋮ Efficient algorithm for proper orthogonal decomposition of block-structured adaptively refined numerical simulations ⋮ Robust fixed-lag smoothing under model perturbations ⋮ Decomposition methods based on articulation vertices for degree-dependent spanning tree problems ⋮ Fast point and element search method in adaptive remeshing procedure and its applications ⋮ Unnamed Item ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Shapley-Folkman-Lyapunov theorem and asymmetric first price auctions ⋮ Variable Moving Average Transform Stitching Waves ⋮ A Markov chain on the solution space of edge colorings of bipartite graphs ⋮ A localized approach for the method of approximate particular solutions ⋮ Median filtering: a new insight ⋮ Toolgraph design of optimal and feasible control strategies for time-varying dynamical systems ⋮ The power of linear-time data reduction for maximum matching ⋮ Polynomial approximations of electronic wave functions ⋮ Unnamed Item ⋮ Path length statistics in reservoir computers ⋮ Noise-Robust Modes of the Retinal Population Code Have the Geometry of “Ridges” and Correspond to Neuronal Communities ⋮ Modeling and simulation of the production process of electrical energy in a geothermal power plant ⋮ Optimal design of electromagnetic devices: development of an efficient optimization tool based on smart mutation operations implemented in a genetic algorithm ⋮ A note on testing axioms of revealed preference ⋮ A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5 ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ Unnamed Item ⋮ Mixed cell computation in HOM4ps ⋮ Parallel degree computation for binomial systems ⋮ Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution ⋮ Range Majority in Constant Time and Linear Space ⋮ Local RBF Algorithms for Elliptic Boundary Value Problems in Annular Domains ⋮ Monte Carlo solution of combinatorial optimization problems ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Design tools for reporter strands and DNA origami scaffold strands ⋮ Unnamed Item ⋮ Linear-space data structures for range mode query in arrays ⋮ Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem ⋮ Anytime coalition structure generation in multi-agent systems with positive or negative externalities ⋮ The Secret Life of Keys: On the Calculation of Mechanical Lock Systems ⋮ Approximating a real number by a rational number with a limited denominator: a geometric approach ⋮ Quality analysis in acyclic production networks ⋮ Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ Greedy algorithms for the minimization knapsack problem: average behavior ⋮ A quantum algorithm for Viterbi decoding of classical convolutional codes ⋮ Об одном методе поиска глобального экстремума непрерывной функции на симплексе ⋮ Sequencing surgical cases in a day-care environment: an exact branch-and-price approach ⋮ Bisimulation of type 2 for BL-general fuzzy automata ⋮ Confluence up to garbage in graph transformation ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around ⋮ On Nonparametric Maximum Likelihood Estimation with Interval Censoring and Left Truncation ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Properties of the \(d\)-dimensional Earth mover's problem ⋮ Tensors, matchings and codes ⋮ Low dimensional manifolds in reservoir computers ⋮ The Power of Linear-Time Data Reduction for Maximum Matching ⋮ Numerical solution of two-dimensional nonlinear sine-Gordon equation using localized method of approximate particular solutions ⋮ Unnamed Item ⋮ Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube ⋮ Enumerating a subset of the integer points inside a Minkowski sum ⋮ An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph ⋮ On the number of reachable pairs in a digraph ⋮ Using basis dependence distance vectors in the modified Floyd-Warshall algorithm ⋮ Distributed algorithms for matching in hypergraphs ⋮ Safety in \(s\)-\(t\) paths, trails and walks ⋮ Sparse data structure design for wavelet-based methods
This page was built for software: Stony Brook
