1300 search results - page 108 / 260 » Constraint satisfaction problems and global cardinality cons... |
CP
2006
Springer
15 years 1 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...
117
click to vote
CP
2010
Springer
14 years 8 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
SMA
2006
ACM
15 years 4 months ago
2006
ACM
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
CP
2004
Springer
15 years 1 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...