829 search results - page 60 / 166 » Bandit Algorithms for Tree Search |
IJCAI
2003
14 years 11 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
SIPS
2007
IEEE
15 years 4 months ago
2007
IEEE
: - Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
CG
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...