829 search results - page 59 / 166 » Bandit Algorithms for Tree Search |
WADS
1989
Springer
15 years 1 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
EMNLP
2009
14 years 7 months ago
2009
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The res...
WSC
2008
15 years 2 days ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
AIMSA
1990
Springer
15 years 1 months ago
1990
Springer
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
ICCS
2004
Springer
15 years 3 months ago
2004
Springer
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...