1381 search results - page 44 / 277 » Computational Complexity of Constraint Satisfaction |
CORR
2010
Springer
15 years 3 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...
120
click to vote
KBS
2007
15 years 3 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...
SAC
2006
ACM
15 years 9 months ago
2006
ACM
112
click to vote
AAAI
2004
15 years 5 months ago
2004
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...
122
Voted
IRI
2006
IEEE
15 years 9 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...