808 search results - page 28 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
120
click to vote
JAIR
2007
15 years 5 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...
143
click to vote
ECAI
2004
Springer
15 years 10 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 ...
146
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
135
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
139
Voted
CSR
2006
Springer
15 years 9 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...