829 search results - page 111 / 166 » Bandit Algorithms for Tree Search |
CPM
1999
Springer
15 years 2 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
ICML
2007
IEEE
15 years 10 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...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
BIRTHDAY
2008
Springer
14 years 11 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...