3055 search results - page 42 / 611 » Randomized Search Trees |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
STOC
1994
ACM
14 years 1 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...