18 search results - page 1 / 4 » A Branch and Bound Algorithm for Numerical MAX-CSP |
CP
2008
Springer
13 years 9 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
CP
2001
Springer
13 years 12 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...
SAT
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...