Definitive Computer Science Specifications, Linux How-To Guides & System Architecture.
Minimax is a recursive backtracking decision-making algorithm used in two-player, zero-sum, perfect-information games. It models the interaction between two adversarial agents—Maximizer and Minimizer—under the...
Maximum Inner-Product Search (MIPS) is the foundational algorithmic challenge of retrieving the top-k vectors from a dataset that maximize the inner product with a...
MaMF (Matrix-assisted Multi-Feature Filtering) is an advanced algorithmic pattern engineered to process high-dimensional multi-feature streams against dynamic matrix-stored threshold criteria. By transforming sequential conditional...
Look-ahead with backtracking is a systematic algorithmic paradigm for traversing discrete state-space trees to solve combinatorial optimization and constraint satisfaction problems (CSPs). By combining...
Locality-Sensitive Hashing (LSH) is an algorithmic paradigm designed to solve the approximate nearest neighbor (ANN) search problem in high-dimensional vector spaces. Unlike traditional cryptographic...
The Linear-Quadratic Regulator Rapidly-Exploring Random Tree (LQR-RRT) is a sampling-based kinodynamic motion planning algorithm that integrates asymptotic optimality with linear-quadratic regulator feedback controllers as...
Linear search is a foundational algorithmic technique used to find a target value within a sequential data structure. It operates by sequentially inspecting each...
Linear probing is a cache-conscious collision resolution algorithm used in open-addressing hash tables. When a hash collision occurs at index h, the algorithm sequentially...
Linear Hashing is a dynamic hashing scheme invented by Witold Litwin in 1980 that allows hash tables to grow and shrink incrementally without the...
Lifelong Planning A* (LPA*) is an incremental heuristic search algorithm that efficiently computes shortest paths between a static start vertex and a goal vertex...