380 search results - page 11 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
CP
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
ECCC
2006
13 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
AAAI
1994
13 years 8 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...