2828 search results - page 157 / 566 » Custom Local Search |
158
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
186
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
169
click to vote
AAAI
2006
15 years 7 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
172
click to vote
JCC
2008
15 years 6 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
158
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...