Examples of EAs include genetic algorithm (GA) , differential evolution (DE) [11-14], covariance matrix adaptation evolution strategy (CMAES) , and the backtracking search
optimization algorithm (BSA) .
Liu, "Decision-theoretic rough set attribute reduction based on backtracking search
algorithm," Computer Engineering and Applications, vol.
Section 3 formulates a mixed integer programming model, and subsequently in Section 4, an improved backtracking search
algorithm is proposed to obtain the solution.
For example, a backtracking search
technique [4, 5] is a search based algorithm which systematically generates all possible solutions for the given NA-N board.
In this paper, an alternative metaheuristic technique based on a backtracking search
optimization algorithm (BSA)  is employed for the synthesis of CCAA with the low sidelobe levels at a fixed beamwidth.
[44.] Civicioglu, P., "Backtracking Search
Optimization Algorithm for numerical optimization problems," Appl.
(A simple LegalMove procedure might simply keep track of the highest-scoring move, and discard the rest.) We can express the backtracking search
as a recursive procedure ExtendRight: ExtendRight (PartialWord, node N in dawg, square) = if square is vacant then If N is a terminal node then LegalMove (PartialWord) for each edge E out of N if the letter l labeling edge E is in our rack and l is in the cross-check set of square then remove a tile l from the rack let N' be the node reached by following edge E let next-square be the square to the right of square ExtendRight (PartialWord .
Basic backtracking search
builds up a partial solution by choosing values for variables until it reaches a dead end, where the partial solution cannot be consistently extended.
For contributions to temporal reasoning, backtracking search
algorithms, and constraint programming.
A human-level AI must either integrate, for example, backtracking search
, partially observable Markov decision processes (POMDPs), logic theorem proving algorithms, productions systems, and neural networks, or it must be based on new, heretofore undiscovered computational methods that exhibit all of the best features of these computational methods.
Fahiem Bacchus (University of Toronto), the third invited speaker, presented his work on the use of caching in backtracking search
Both texts cover the basics of constraint programming, such as local consistency and backtracking search
methods, as well as more specialized topics like linear equations and temporal constraints.