2457 search results - page 138 / 492 » Local Search with Bootstrapping |
AAAI
2006
14 years 11 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...
JCC
2008
14 years 10 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...
CG
2008
Springer
14 years 12 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...
AAAI
2004
14 years 11 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
DELOS
2004
14 years 11 months ago
2004
We consider the problem of collaborative search across a large number of digital libraries and query routing strategies in a peerto-peer (P2P) environment. Both digital libraries a...