405 search results - page 31 / 81 » On the Complexity of Global Constraint Satisfaction |
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
82
Voted
COMPULOG
1999
Springer
15 years 3 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...
119
click to vote
CSMR
1998
IEEE
15 years 3 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
KBS
2007
14 years 11 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...