3055 search results - page 83 / 611 » Randomized Search Trees |
95
Voted
AAAI
2006
15 years 3 months ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
110
Voted
NECO
2002
15 years 1 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
133
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
129
Voted
JACM
2007
15 years 2 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
129
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...