1300 search results - page 1 / 260 » Constraint satisfaction problems and global cardinality cons... |
LICS
2009
IEEE
14 years 1 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
CACM
2010
13 years 7 months ago
2010
CSL
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2004
Springer
13 years 6 months ago
2004
Springer
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
CP
2004
Springer
14 years 12 days ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...