1548 search results - page 1 / 310 » Statistical Modelling of CSP Solving Algorithms Performance |
CP
2005
Springer
13 years 11 months ago
2005
Springer
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...
CP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
AAAI
1997
13 years 6 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
CP
1998
Springer
13 years 9 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...