SettingsSearch algorithms
A* search algorithm
In computer science, A* (pronounced "A star" ( listen)) is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable pa...
In computer science, A* (pronounced "A star" ( listen)) is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently traversable pa...
Aho-Corasick string matching algorithm
The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick.
The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick.
Aho–Corasick string matching algorithm
The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick.
The Aho–Corasick string matching algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick.
All nearest smaller values
In computer science, the all nearest smaller values problem involves computing, for each value in a sequence of numbers, the previous smaller value that has the closest position in the sequence ...
In computer science, the all nearest smaller values problem involves computing, for each value in a sequence of numbers, the previous smaller value that has the closest position in the sequence ...
Alpha-beta pruning
Alpha-beta pruning is a search algorithm which seeks to increase the number of nodes that are evaluated by the minimax algorithm in its search tree.
Alpha-beta pruning is a search algorithm which seeks to increase the number of nodes that are evaluated by the minimax algorithm in its search tree.
Amplitude amplification
Amplitude amplification is a technique in quantum computing which generalizes the idea behind the Grover's search algorithm, and gives rise to a family of quantum algorithms.
Amplitude amplification is a technique in quantum computing which generalizes the idea behind the Grover's search algorithm, and gives rise to a family of quantum algorithms.
Any-angle path planning
Any-angle path planning algorithms search for paths on a cell decomposition of a continuous configuration space (such as a two-dimensional terrain).
Any-angle path planning algorithms search for paths on a cell decomposition of a continuous configuration space (such as a two-dimensional terrain).
B*
In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.
In computer science, B* is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node.
Backjumping
In backtracking algorithms, backjumping is a technique that reduces search space, therefore increasing efficiency.
In backtracking algorithms, backjumping is a technique that reduces search space, therefore increasing efficiency.
Backtracking
Backtracking is a general algorithm for finding all solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c as ...
Backtracking is a general algorithm for finding all solutions to some computational problem, that incrementally builds candidates to the solutions, and abandons each partial candidate c as ...
Beam search
In computer science, beam search is an heuristic search algorithm that explores a graph by expanding the most promising node in a limited set.
In computer science, beam search is an heuristic search algorithm that explores a graph by expanding the most promising node in a limited set.
Beam stack search
Beam Stack Search is a search algorithm that combines chronological backtracking (that is, depth-first search) with beam search and is similar to Depth-First Beam Search.
Beam Stack Search is a search algorithm that combines chronological backtracking (that is, depth-first search) with beam search and is similar to Depth-First Beam Search.
Best Bin First
Best Bin First is a search algorithm which is designed to efficiently find an approximate solution to the Nearest Neighbor Search Problem in very high dimensional spaces.
Best Bin First is a search algorithm which is designed to efficiently find an approximate solution to the Nearest Neighbor Search Problem in very high dimensional spaces.
Best bin first
Best bin first is a search algorithm that is designed to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces.
Best bin first is a search algorithm that is designed to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces.
Best-first search
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule.
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule.
Bidirectional search
Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph.
Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph.
Binary search algorithm
In computer science, a binary search or half-interval search algorithm finds the position of a specified value (the input "key") within a sorted array.
In computer science, a binary search or half-interval search algorithm finds the position of a specified value (the input "key") within a sorted array.
Bitap algorithm
The bitap algorithm (also known as the shift-or, shift-and or Baeza–Yates–Gonnet algorithm) is an approximate string matching algorithm.
The bitap algorithm (also known as the shift-or, shift-and or Baeza–Yates–Gonnet algorithm) is an approximate string matching algorithm.
Boyer-Moore string search algorithm
The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature.
The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature.
Boyer-Moore-Horspool algorithm
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings.
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings.
Boyer–Moore string search algorithm
The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature.
The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature.
Boyer–Moore–Horspool algorithm
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings.
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings.
Breadth-first search
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes.
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes.
Brute-force search
In computer science, brute-force search or exhaustive search, also known as generate and test, is a trivial but very general problem-solving technique that consists of systematically...
In computer science, brute-force search or exhaustive search, also known as generate and test, is a trivial but very general problem-solving technique that consists of systematically...
bsearch
In the C standard library, bsearch is a function used to search for an object in a sorted array.
In the C standard library, bsearch is a function used to search for an object in a sorted array.
C-Link
C-Link is new search tool for finding related and possibly unknown concepts that lie on a path between two known concept.
C-Link is new search tool for finding related and possibly unknown concepts that lie on a path between two known concept.
Commentz-Walter algorithm
The Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter.
The Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter.
Cuckoo hashing
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table.
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table.
Dancing Links
In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...
In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, de...
Deducting Search Algorithm
The Deducting Search Algorithm (DSA), also known as the Holmes Engine after the author Sir Arthur Conan Doyle’s famous sleuth, is a mathematical formula that interprets the choices m...
The Deducting Search Algorithm (DSA), also known as the Holmes Engine after the author Sir Arthur Conan Doyle’s famous sleuth, is a mathematical formula that interprets the choices m...
Depth-first search
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph.
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph.
Depth-limited search
In computer science depth-limited search is an algorithm to explore the vertices of a graph.
In computer science depth-limited search is an algorithm to explore the vertices of a graph.
Dichotomic search
In computer science, a dichotomic search is a search algorithm that operates by selecting between two distinct alternatives (dichotomies) at each step.
In computer science, a dichotomic search is a search algorithm that operates by selecting between two distinct alternatives (dichotomies) at each step.
Difference map algorithm
The difference map algorithm is a search algorithm for general constraint satisfaction problems.
The difference map algorithm is a search algorithm for general constraint satisfaction problems.
Difference-map algorithm
The difference-map algorithm is a search algorithm for general constraint satisfaction problems.
The difference-map algorithm is a search algorithm for general constraint satisfaction problems.
Dijkstra's algorithm
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a g...
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a g...
Double hashing
Double hashing is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key.
Double hashing is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key.
DSW algorithm
The DSW algorithm, or in full Day/Stout/Warren algorithm, is a method for efficiently balancing binary search trees — that is, decreasing their height to O(log n) nodes, where ...
The DSW algorithm, or in full Day/Stout/Warren algorithm, is a method for efficiently balancing binary search trees — that is, decreasing their height to O(log n) nodes, where ...
Dynamic perfect hashing
Dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure.
Dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure.
Expectiminimax tree
An expectiminimax tree is a specialized variation of a minimax game tree for use in artificial intelligence systems that play two-player zero-sum games such as backgammon, in which the outcome d...
An expectiminimax tree is a specialized variation of a minimax game tree for use in artificial intelligence systems that play two-player zero-sum games such as backgammon, in which the outcome d...
Extendible hashing
Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup.
Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup.
Fibonacci search technique
The Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers.
The Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers.
Fractional cascading
In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures.
In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures.
Genetic algorithm
A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution.
A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution.
Geometric hashing
In computer science, geometric hashing is originally a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation, though ...
In computer science, geometric hashing is originally a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation, though ...
God's algorithm
God's algorithm is a notion originating in discussions of ways to solve the Rubik's Cube puzzle, but which can also be applied to other combinatorial puzzles and mathematical games.
God's algorithm is a notion originating in discussions of ways to solve the Rubik's Cube puzzle, but which can also be applied to other combinatorial puzzles and mathematical games.
Graphplan
Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995.
Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995.
Grover's algorithm
Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O(log N) storage space (see big O notation).
Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O(log N) storage space (see big O notation).
Hash function
A hash function is any algorithm or subroutine that maps large data sets, called keys, to smaller data sets.
A hash function is any algorithm or subroutine that maps large data sets, called keys, to smaller data sets.
Hash table
In computer science, a hash table or hash map is a data structure that uses a hash function to map identifying values, known as keys (e.g., a person's name), to their associated values (e....
In computer science, a hash table or hash map is a data structure that uses a hash function to map identifying values, known as keys (e.g., a person's name), to their associated values (e....
Hill climbing
In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search.
In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search.
Hopscotch hashing
Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing.
Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing.
IDA*
IDA* is a variant of the A* search algorithm which uses iterative deepening to keep the memory usage lower than in A*.
IDA* is a variant of the A* search algorithm which uses iterative deepening to keep the memory usage lower than in A*.
Incremental heuristic search
Incremental heuristic search algorithms combine both incremental and heuristic search to speed up searches of sequences of similar search problems, which is important in domains that are only in...
Incremental heuristic search algorithms combine both incremental and heuristic search to speed up searches of sequences of similar search problems, which is important in domains that are only in...
Index mapping
Index mapping is a computer science term (also known as a "trivial hash function") that is used to describe the mapping of raw data, used directly as in array index, for an array.
Index mapping is a computer science term (also known as a "trivial hash function") that is used to describe the mapping of raw data, used directly as in array index, for an array.
Interpolation search
Interpolation search (sometimes referred to as extrapolation search) is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key.
Interpolation search (sometimes referred to as extrapolation search) is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key.
Inverted index
In computer science, an inverted index (also referred to as postings file or inverted file) is an index data structure storing a mapping from content, such as words or numbers, to it...
In computer science, an inverted index (also referred to as postings file or inverted file) is an index data structure storing a mapping from content, such as words or numbers, to it...
Jump search
In computer science, a jump search or block search refers to a search algorithm for ordered lists.
In computer science, a jump search or block search refers to a search algorithm for ordered lists.
k-nearest neighbor algorithm
In pattern recognition, the k-nearest neighbor algorithm is a method for classifying objects based on closest training examples in the feature space.
In pattern recognition, the k-nearest neighbor algorithm is a method for classifying objects based on closest training examples in the feature space.
Knuth's Algorithm X
Donald Knuth's Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem represented by a matrix A consisting of 0...
Donald Knuth's Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem represented by a matrix A consisting of 0...
Knuth-Morris-Pratt algorithm
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
Knuth-Morris–Pratt algorithm
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
Knuth–Morris–Pratt algorithm
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch ...
Late Move Reductions
Late Move Reductions (LMR) is a non-game specific enhancement to the alpha-beta algorithm and its variants which attempts to examine a game search tree more efficiently.
Late Move Reductions (LMR) is a non-game specific enhancement to the alpha-beta algorithm and its variants which attempts to examine a game search tree more efficiently.
Lexicographic breadth-first search
In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph, that is used as part of other graph algorithms such as the rec...
In computer science, lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph, that is used as part of other graph algorithms such as the rec...
Linear hashing
Linear hashing is a dynamic hash table algorithm invented by Witold Litwin (1980), and later popularized by Paul Larson.
Linear hashing is a dynamic hash table algorithm invented by Witold Litwin (1980), and later popularized by Paul Larson.
Linear probing
Linear probing is a scheme in computer programming for resolving hash collisions of values of hash functions by sequentially searching the hash table for a free location.
Linear probing is a scheme in computer programming for resolving hash collisions of values of hash functions by sequentially searching the hash table for a free location.
Linear search
In computer science, linear search or sequential search is a method for finding a particular value in a list, that consists of checking every one of its elements, one at a time and in sequ...
In computer science, linear search or sequential search is a method for finding a particular value in a list, that consists of checking every one of its elements, one at a time and in sequ...
Locality sensitive hashing
Locality Sensitive Hashing (LSH) is a method of performing probabilistic dimension reduction of high-dimensional data.
Locality Sensitive Hashing (LSH) is a method of performing probabilistic dimension reduction of high-dimensional data.
Locality-sensitive hashing
Locality Sensitive Hashing (LSH) is a method of performing probabilistic dimension reduction of high-dimensional data.
Locality Sensitive Hashing (LSH) is a method of performing probabilistic dimension reduction of high-dimensional data.
Look-ahead (backtracking)
In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable to evaluate or one of its values.
In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable to evaluate or one of its values.
Lookahead
Lookahead is a tool in algorithms for looking ahead a few more input items before making a cost effective decision at one stage of the algorithm.
Lookahead is a tool in algorithms for looking ahead a few more input items before making a cost effective decision at one stage of the algorithm.
MaMF
MaMF, or Mammalian Motif Finder, is an algorithm for identifying motifs to which transcription factors bind.
MaMF, or Mammalian Motif Finder, is an algorithm for identifying motifs to which transcription factors bind.
Minimax
Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss while maximizing the potential gain.
Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss while maximizing the potential gain.
MTD-f
MTD(f), an abbreviation of MTD(n,f) (Memory-enhanced Test Driver with node n and value f) is a minimax search algorithm, an alternative to the alpha-beta pruning algorithm.
MTD(f), an abbreviation of MTD(n,f) (Memory-enhanced Test Driver with node n and value f) is a minimax search algorithm, an alternative to the alpha-beta pruning algorithm.
Nearest neighbor search
Nearest neighbor search (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric ...
Nearest neighbor search (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric ...
Null-move heuristic
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
Parallel metaheuristic
ParadisEO is a white-box object-oriented framework dedicated to the flexible design of metaheuristics.
ParadisEO is a white-box object-oriented framework dedicated to the flexible design of metaheuristics.
Perfect hash function
A perfect hash function for a set S is a hash function that maps distinct elements in S to distinct integers, with no collisions.
A perfect hash function for a set S is a hash function that maps distinct elements in S to distinct integers, with no collisions.
Phrase search
Phrase Search is a type of full text search that matches only those documents that contain a specified phrase, such as "Wikipedia, the free encyclopedia.
Phrase Search is a type of full text search that matches only those documents that contain a specified phrase, such as "Wikipedia, the free encyclopedia.
Proof-number search
Proof-number search (short: PN search) is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.
Proof-number search (short: PN search) is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.
Rabin-Karp string search algorithm
The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text.
The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text.
Rabin–Karp string search algorithm
The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text.
The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text.
Rainbow table
A rainbow table is a precomputed table for reversing cryptographic hash functions, usually for cracking password hashes.
A rainbow table is a precomputed table for reversing cryptographic hash functions, usually for cracking password hashes.
Rapidly-exploring dense trees
Rapidly-exploring Dense Trees is a family of planning algorithms that includes Rapidly-exploring_random_tree.
Rapidly-exploring Dense Trees is a family of planning algorithms that includes Rapidly-exploring_random_tree.
Rapidly-exploring random tree
A Rapidly-exploring random tree (RRT) is a data structure and algorithm designed for efficiently searching nonconvex, high-dimensional search spaces.
A Rapidly-exploring random tree (RRT) is a data structure and algorithm designed for efficiently searching nonconvex, high-dimensional search spaces.
Search algorithm
In computer science, a search algorithm, never speaking, is an algorithm for finding an item with specified properties among a collection of items.
In computer science, a search algorithm, never speaking, is an algorithm for finding an item with specified properties among a collection of items.
Search games
A search game is a two-person zero-sum game which takes place in a set called the search space.
A search game is a two-person zero-sum game which takes place in a set called the search space.
Search suggest drop-down list
A search suggest drop-down list is a query feature used in computing.
A search suggest drop-down list is a query feature used in computing.
Search-based software engineering
Search-based software engineering (SBSE) is an approach to apply metaheuristic search techniques like genetic algorithms, simulated annealing and tabu search to software engineering problems.
Search-based software engineering (SBSE) is an approach to apply metaheuristic search techniques like genetic algorithms, simulated annealing and tabu search to software engineering problems.
Semi-linear resolution
Semi-Linear Resolution (SLR) is a search strategy (used in the automated theorem prover (ATP) CARINE) that is based on an iteratively-deepening depth-first search.
Semi-Linear Resolution (SLR) is a search strategy (used in the automated theorem prover (ATP) CARINE) that is based on an iteratively-deepening depth-first search.
Siamese method
The Siamese method, or De la Loubère method, is a simple method to construct any size of n-odd magic squares (i.e.
The Siamese method, or De la Loubère method, is a simple method to construct any size of n-odd magic squares (i.e.
Spreading activation
Spreading activation is a method for searching associative networks, neural networks, or semantic networks.
Spreading activation is a method for searching associative networks, neural networks, or semantic networks.
SSS*
SSS* is a search algorithm, introduced by George Stockman in 1979, that conducts a state space search traversing a game tree in a best-first fashion similar to that of the A* search algorithm.
SSS* is a search algorithm, introduced by George Stockman in 1979, that conducts a state space search traversing a game tree in a best-first fashion similar to that of the A* search algorithm.
Stack search
Stack search (also known as Stack decoding algorithm) is a search algorithm similar to beam search.
Stack search (also known as Stack decoding algorithm) is a search algorithm similar to beam search.
State space search
State space search is a process used in the field of artificial intelligence (AI) in which successive configurations or states of an instance are considered, with the goal of finding a goa...
State space search is a process used in the field of artificial intelligence (AI) in which successive configurations or states of an instance are considered, with the goal of finding a goa...
Strcspn
strcspn is the function from c standard library.
strcspn is the function from c standard library.
String searching algorithm
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called pat...
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called pat...
Ternary search
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function (function that is either strictly increasing and then strictly decreasing ...
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function (function that is either strictly increasing and then strictly decreasing ...
Ternary search tree
In computer science, a ternary search tree is a special trie data structure where the child nodes of a standard trie node are ordered as a binary search tree.
In computer science, a ternary search tree is a special trie data structure where the child nodes of a standard trie node are ordered as a binary search tree.
Trigram search
Trigram search is a powerful method of searching for text when the exact syntax or spelling of the target object is not precisely known.
Trigram search is a powerful method of searching for text when the exact syntax or spelling of the target object is not precisely known.
Uniform binary search
Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming.
Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming.
Uniform-cost search
In computer science, uniform-cost search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph.
In computer science, uniform-cost search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph.
Universal hashing
Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see defi...
Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see defi...
UUHash
UUHash is a hash algorithm employed by clients on the FastTrack network.
UUHash is a hash algorithm employed by clients on the FastTrack network.
Variation (game tree)
A Variation can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game that is being played.
A Variation can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game that is being played.
Zhu–Takaoka string matching algorithm
The Zhu–Takaoka string matching algorithm is a variant of the Boyer–Moore string search algorithm.
The Zhu–Takaoka string matching algorithm is a variant of the Boyer–Moore string search algorithm.
Ε-approximate nearest neighbor search
ε-approximate nearest neighbor search is a special case of nearest neighbor search in which we are searching for points that are close to a query point.
ε-approximate nearest neighbor search is a special case of nearest neighbor search in which we are searching for points that are close to a query point.