Sciweavers

234 search results - page 1 / 47
» The Complexity of Global Cardinality Constraints
Sort
View
LICS
2009
IEEE
13 years 11 months ago
The Complexity of Global Cardinality Constraints
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 ...
Andrei A. Bulatov, Dániel Marx
CPAIOR
2006
Springer
13 years 8 months ago
Improved Algorithm for the Soft Global Cardinality Constraint
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
Alessandro Zanarini, Michela Milano, Gilles Pesant
CATS
2008
13 years 6 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
AAAI
2004
13 years 6 months ago
The Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
Christian Bessière, Emmanuel Hebrard, Brahi...
JCP
2006
91views more  JCP 2006»
13 years 4 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...