314 search results - page 3 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
CORR
2010
Springer
13 years 7 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...
CSCLP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
CP
2005
Springer
13 years 9 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
CP
1995
Springer
13 years 11 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...
PROCEDIA
2011
12 years 10 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...