1051 search results - page 40 / 211 » Foundations of Constraint Satisfaction |
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...