749 search results - page 48 / 150 » Dualities for Constraint Satisfaction Problems |
CP
1997
Springer
15 years 4 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...
100
click to vote
CP
1995
Springer
15 years 4 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
98
Voted
CORR
2011
Springer
14 years 4 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...
JAIR
2007
15 years 13 days 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...
101
Voted
ECAI
2004
Springer
15 years 6 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 ...