346 search results - page 61 / 70 » Solving quantified constraint satisfaction problems |
110
click to vote
KR
1992
Springer
15 years 1 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...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
CP
1998
Springer
15 years 1 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...