4524 search results - page 22 / 905 » The Complexity of Global Constraints |
113
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
97
Voted
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this g...
100
Voted
CSR
2006
Springer
15 years 4 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
102
click to vote
CPAIOR
2004
Springer
15 years 4 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
113
click to vote
IVC
2007
15 years 9 days ago
2007
Establishing the correct correspondence between features in an image set remains a challenging problem amongst computer vision researchers. In fact, the combinatorial nature of fe...