1264 search results - page 10 / 253 » The framework approach for constraint satisfaction |
JAL
2008
14 years 11 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
ECAI
2004
Springer
15 years 5 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 ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
CISSE
2009
Springer
15 years 3 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...