2109 search results - page 14 / 422 » Solving Necklace Constraint Problems |
173
click to vote
PROCEDIA
2011
14 years 4 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...
112
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
111
Voted
TRANSCI
2010
14 years 8 months ago
2010
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
126
Voted
SAGA
2001
Springer
15 years 6 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
137
click to vote
CONSTRAINTS
2011
14 years 9 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...