714 search results - page 47 / 143 » Lexicographically-ordered constraint satisfaction problems |
106
Voted
CP
1997
Springer
15 years 7 months ago
1997
Springer
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
119
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
105
Voted
JAIR
2007
15 years 3 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
126
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
121
Voted
CSR
2006
Springer
15 years 7 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...