44 search results - page 8 / 9 » Monte Carlo Tree Search in Hex |
AAAI
2006
14 years 11 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...
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
NCA
2006
IEEE
14 years 10 months ago
2006
IEEE
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
TCIAIG
2010
14 years 5 months ago
2010
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
ACL
2000
14 years 11 months ago
2000
We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi ...