5 search results - page 1 / 1 » Faster Algorithms for Bound-Consistency of the Sortedness an... |
CP
2000
Springer
13 years 8 months ago
2000
Springer
IJCAI
2003
13 years 5 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
AAAI
2010
13 years 5 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
CSCLP
2005
Springer
13 years 10 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...