829 search results - page 64 / 166 » Bandit Algorithms for Tree Search |
113
click to vote
DATAMINE
1999
14 years 9 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
AAAI
1996
14 years 11 months ago
1996
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...