3055 search results - page 32 / 611 » Randomized Search Trees |
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
CG
2008
Springer
13 years 11 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...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next...
BIBE
2007
IEEE
14 years 3 months ago
2007
IEEE
—The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution