The following pages link to Introduction to algorithms (Q2747613):
Displaying 50 items.
- Probing the space of toric quiver theories (Q365086) (← links)
- Generalizations of Wiener polarity index and terminal Wiener index (Q367047) (← links)
- Fastest-path planning for direction-dependent speed functions (Q368729) (← links)
- Exploiting symmetries for scaling loopy belief propagation and relational training (Q374162) (← links)
- Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics (Q380957) (← links)
- Nonrigid 3D medical image registration and fusion based on deformable models (Q382687) (← links)
- A hybrid model predictive control scheme for containment and distributed sensing in multi-agent systems (Q385424) (← links)
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- Fast recognition of doubled graphs (Q385965) (← links)
- Optimal working time distribution and routing for autonomous tractors based on heuristic algorithms (Q386924) (← links)
- Solving the quadratic minimum spanning tree problem (Q387698) (← links)
- On optimal cryptographic key derivation (Q388109) (← links)
- One-dimensional approximate point set pattern matching with \(L_p\)-norm (Q389940) (← links)
- Efficient string-matching allowing for non-overlapping inversions (Q390885) (← links)
- A new dichotomic algorithm for the uniform random generation of words in regular languages (Q391418) (← links)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- On the Kirchhoff and the Wiener indices of graphs and block decomposition (Q405105) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- Physical portrayal of computational complexity (Q408483) (← links)
- Face recognition from caption-based supervision (Q409141) (← links)
- Computing convex quadrangulations (Q412380) (← links)
- Running time analysis of ant colony optimization for shortest path problems (Q414437) (← links)
- Crossover can provably be useful in evolutionary computation (Q418021) (← links)
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs (Q418035) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- A local level-set method using a hash table data structure (Q419607) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- A fast object-oriented MATLAB implementation of the reproducing kernel particle method (Q422335) (← links)
- Scaling the kernel function based on the separating boundary in input space: a data-dependent way for improving the performance of kernel methods (Q425515) (← links)
- Aerospace design optimization using a steady state real-coded genetic algorithm (Q426469) (← links)
- Can quantum entanglement detection schemes improve search? (Q430116) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Computing optimal islands (Q433119) (← links)
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics (Q433416) (← links)
- On efficient calculations for Bayesian variable selection (Q434881) (← links)
- Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability (Q436341) (← links)
- An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids (Q436744) (← links)
- Spherical coverage verification (Q440948) (← links)
- A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems (Q441879) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- Designing and proving correct a convex hull algorithm with hypermaps in Coq (Q448980) (← links)
- Committee selection under weight constraints (Q449043) (← links)
- Full-rank representations of outer inverses based on the QR decomposition (Q449491) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- A new distributed topology control algorithm based on optimization of delay and energy in wireless networks (Q455983) (← links)
- An accurate performance model for network-on-chip and multicomputer interconnection networks (Q455994) (← links)
