829 search results - page 30 / 166 » Bandit Algorithms for Tree Search |
ACG
2006
Springer
15 years 3 months ago
2006
Springer
A plethora of enhancements are available to be used together with the αβ search algorithm. There are so many, that their selection and implementation is a non-trivial task, even ...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
IJCAI
2007
14 years 11 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...