391 search results - page 6 / 79 » Locally Consistent Constraint Satisfaction Problems with Bin... |
RSA
2006
13 years 5 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
AICOM
2004
13 years 5 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
CSL
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
CP
2005
Springer
13 years 11 months ago
2005
Springer