178 citations · 178 across the 2 of their papers we have counts for
3 papers
cs.AI2014★ 178 cited
Bandit Algorithms for Tree Search
Pierre-Arnuad Coquelin, Remi Munos
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to re-…
cs.LG2009
Optimal Policies Search for Sensor Management
Thomas Bréhard, Emmanuel Duflos, Philippe Vanheeghe +1
This paper introduces a new approach to solve sensor management problems. Classically sensor management problems can be well formalized as Partially-Observed Markov Decision Proces…
cs.LG2007
Bandit Algorithms for Tree Search
Pierre-Arnaud Coquelin, Rémi Munos
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go (Gelly et al., 2006). The UCT algorithm (Kocsis and Szepesva…