3 search results - page 1 / 1 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
112
click to vote
HM
2009
Springer
15 years 6 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
HM
2007
Springer
15 years 7 months ago
2007
Springer
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
113
click to vote
HM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...