CP
2006
Springer
13 years 6 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
CP
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. This report presents a generic filtering scheme, based on the graph description of global constraints. This description is defined by a network of binary constraints and ...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
CP
2006
Springer
13 years 8 months ago
2006
Springer
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
CP
2006
Springer
13 years 8 months ago
2006
Springer
CP
2006
Springer
13 years 8 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
CP
2006
Springer
13 years 8 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
CP
2006
Springer
13 years 8 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...