829 search results - page 105 / 166 » Bandit Algorithms for Tree Search |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
SAT
2004
Springer
15 years 3 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
ICDCSW
2003
IEEE
15 years 3 months ago
2003
IEEE
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
AAAI
2006
14 years 11 months ago
2006
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
180
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...