466 search results - page 4 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
COMPGEOM
1995
ACM
13 years 9 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
CSCLP
2005
Springer
13 years 11 months ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
UAI
2003
13 years 7 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
CP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...