466 search results - page 52 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
132
click to vote
MST
2006
15 years 6 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
212
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
185
click to vote
ECCC
2010
15 years 3 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
142
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
167
click to vote
FOCS
2009
IEEE
16 years 25 days ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...