829 search results - page 5 / 166 » Bandit Algorithms for Tree Search |
ALGORITHMICA
2004
13 years 7 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
AAAI
1996
13 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
AAAI
2006
13 years 8 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
ACG
2009
Springer
14 years 2 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
CISIS
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...