scientific article
From MaRDI portal
Publication:3499247
zbMath1149.68081MaRDI QIDQ3499247
Publication date: 29 May 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (61)
Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency ⋮ Weak bisimulations for fuzzy automata ⋮ Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms ⋮ A distributed Kalman filtering algorithm with fast finite-time convergence for sensor networks ⋮ Explicit physics-informed neural networks for nonlinear closure: the case of transport in tissues ⋮ Localized method of approximate particular solutions with polynomial basis functions ⋮ An obstruction to solvability of the reach control problem using affine feedback ⋮ Practical distribution-sensitive point location in triangulations ⋮ 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 ⋮ Unnamed Item ⋮ How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results ⋮ Model reduction of distributed nonstationary LPV systems ⋮ On kernelization and approximation for the vector connectivity problem ⋮ Timed runtime monitoring for multiparty conversations ⋮ Identifying codes on directed de Bruijn graphs ⋮ Robust fixed-lag smoothing under model perturbations ⋮ Decomposition methods based on articulation vertices for degree-dependent spanning tree problems ⋮ Unnamed Item ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Shapley-Folkman-Lyapunov theorem and asymmetric first price auctions ⋮ 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 ⋮ 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 ⋮ 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 simplified algorithm computing all \(s-t\) bridges and articulation points ⋮ 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 ⋮ Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution ⋮ Range Majority in Constant Time and Linear Space ⋮ Monte Carlo solution of combinatorial optimization problems ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ 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 ⋮ Quality analysis in acyclic production networks ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ A quantum algorithm for Viterbi decoding of classical convolutional codes ⋮ Об одном методе поиска глобального экстремума непрерывной функции на симплексе ⋮ Sequencing surgical cases in a day-care environment: an exact branch-and-price approach ⋮ An Event-Driven Algorithm for Agents on the Web ⋮ Confluence up to garbage in graph transformation ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around ⋮ Stony Brook ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Properties of the \(d\)-dimensional Earth mover's problem ⋮ 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 ⋮ Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph ⋮ Using basis dependence distance vectors in the modified Floyd-Warshall algorithm ⋮ Safety in \(s\)-\(t\) paths, trails and walks
This page was built for publication:
