466 search results - page 22 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
116
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
107
click to vote
ICDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
191
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a practical, stratified autocalibration algorithm with theoretical guarantees of global optimality. Given a projective reconstruction, the first stage of the algorithm ...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...