CP
2008
Springer
13 years 6 months ago
2008
Springer
CP
2008
Springer
13 years 6 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
CP
2008
Springer
13 years 6 months ago
2008
Springer
We present new results in crossword composition, showing that our program significantly outperforms previous successful techniques in the literature. We emphasize phase transition ...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper engineers a new state-of-the-art Stochastic Local Search (SLS) for the Low Autocorrelation Binary Sequence (LABS) problem. The new SLS solver is obtained with ...
CP
2008
Springer
13 years 6 months ago
2008
Springer
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
CP
2008
Springer
13 years 6 months ago
2008
Springer
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both wi...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...