13 search results - page 3 / 3 » New Look-Ahead Schemes for Constraint Satisfaction |
LATIN
2010
Springer
13 years 3 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
CP
2010
Springer
13 years 3 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
KR
1992
Springer
13 years 9 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...