4 search results - page 1 / 1 » Extending Soft Arc Consistency Algorithms to Non-invertible ... |
MICAI
2010
Springer
13 years 3 months ago
2010
Springer
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...
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...
HEURISTICS
2006
13 years 4 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...