466 search results - page 1 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
IJCAI
1989
14 years 10 hour ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
AAAI
1996
14 years 5 days ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
ECCV
2002
Springer
15 years 21 days ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
ICIP
2007
IEEE
14 years 5 months ago
2007
IEEE
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...