88 search results - page 6 / 18 » A Parallel Monte-Carlo Tree Search Algorithm |
AAAI
2010
13 years 9 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
NAACL
2010
13 years 5 months ago
2010
Adaptor grammars extend probabilistic context-free grammars to define prior distributions over trees with "rich get richer" dynamics. Inference for adaptor grammars seek...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
ICML
2007
IEEE
14 years 8 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...
DATAMINE
1999
13 years 7 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...