829 search results - page 111 / 166 » Bandit Algorithms for Tree Search |
179
click to vote
CPM
1999
Springer
15 years 11 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...
197
click to vote
ICML
2007
IEEE
16 years 7 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...
151
click to vote
CPAIOR
2005
Springer
16 years 4 days 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...
164
click to vote
ECAI
2004
Springer
15 years 10 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...
194
click to vote
BIRTHDAY
2008
Springer
15 years 8 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...