Search algorithm
In computer science, a search algorithm is an algorithm for finding an item with specified properties among a collection of items. The items may be stored individually as records in a database; or ma...
Search algorithm - Wikipedia
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects. In many such problems, exhausti...
Hash
Hash, Hashes, Hash mark or Hashing may refer to:
String searching algorithm
In computer science, 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 c...
String searching algorithm - Wikipedia
Hash-based message authentication code
In cryptography, a keyed-hash message authentication code (HMAC) is a specific construction for calculating a message authentication code (MAC) involving a cryptographic hash function in combination w...
Hash-based message authentication code - Wikipedia
Disjoint-set data structure
In computing, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track of a set of elements partitioned into a number of disjoint ...
Proof of O(log*n) time complexity of union–find
In computer science, Union Find is an algorithm for doing certain operations on sets. This page is about proof of O(logn) amortized time of Union FindStatement: If m operations, either Union or Find...
Proof of O(log*n) time complexity of union–find - Wikipedia
Search-based software engineering
Search-based software engineering (SBSE) applies metaheuristic search techniques such as genetic algorithms, simulated annealing and tabu search to software engineering problems. Many activities in so...
Search-based software engineering - Wikipedia
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. Although the term is most commo...
Variation (game tree) - Wikipedia
Stack search
Stack search (also known as Stack decoding algorithm) is a search algorithm similar to beam search. It can be used to explore tree-structured search spaces and is often employed in Natural language pr...
Rabin–Karp algorithm
In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string searching algorithm created by Richard M. Karp and Michael O. Rabin (1987) that uses hashing to find ...
Neuroevolution of augmenting topologies
NeuroEvolution of Augmenting Topologies (NEAT) is a genetic algorithm for the generation of evolving artificial neural networks (a neuroevolution technique) developed by Ken Stanley in 2002 while at T...
K-nearest neighbors algorithm
In pattern recognition, the k-Nearest Neighbors algorithm (or k-NN for short) is a non-parametric method used for classification and regression. In both cases, the input consists of the k closest trai...
K-nearest neighbors algorithm - Wikipedia
Uniform-cost search
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstr...
Uniform-cost search - Wikipedia
Beam search
In computer science, beam search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. Beam search is an optimization of best-first search that r...
Minimax
Minimax (sometimes MinMax or MM) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. Original...
Minimax - Wikipedia
Dynamic perfect hashing
In computer science, dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table counterparts, this tech...
Count–min sketch
In computing, the count–min sketch (CM sketch) is a probabilistic data structure that serves as a frequency table of events in a stream of data. It uses hash functions to map events to frequencies, bu...
Grover's algorithm
Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O(N) time and using O(log N) storage space (see big O notation). Lov Grover formulated it in 1996.In...
Grover's algorithm - Wikipedia
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 depends...
Dichotomic search
In computer science, a dichotomic search is a search algorithm that operates by selecting between two distinct alternatives (dichotomies) at each step. It is a specific type of divide and conquer algo...
Dichotomic search - Wikipedia
Jump search
In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items Lkm, where and m is the block size, until an item is found that...
Parallel metaheuristic
Parallel metaheuristic is a class of new advanced techniques that are capable of reducing both the numerical effort and the run time of a metaheuristic. To this end, concepts and technologies from the...
Parallel metaheuristic - Wikipedia
D*
D* (pronounced "D star") is any one of the following three related incremental search algorithms:All three search algorithms solve the same assumption-based path planning problems, including planning ...
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. It uses the assumption that g...
Hill climbing
In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a proble...
Hill climbing - Wikipedia
CityHash
CityHash is a family of non-cryptographic hash functions, designed for fast hashing of strings. It has 32-, 64-, 128-, and 256-bit variants.Google developed the algorithm in-house starting in 2010. Th...
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. It refers to any a...
Semi-linear resolution
CARINE is a first-order classical logic automated theorem prover. CARINE (Computer Aided Reasoning engINE) is a resolution based theorem prover initially built for the study of the enhancement effects...