34 search results - page 3 / 7 » A Hyper-arc Consistency Algorithm for the Soft Alldifferent ... |
COMPULOG
1999
Springer
13 years 9 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
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...
AI
2010
Springer
13 years 5 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...