6554 search results - page 183 / 1311 » Constraint Logic Programming |
207
click to vote
CP
1998
Springer
15 years 10 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
148
click to vote
CPAIOR
2004
Springer
15 years 11 months ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
159
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
181
click to vote
IROS
2008
IEEE
16 years 24 days ago
2008
IEEE
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...
142
click to vote
HM
2007
Springer
16 years 17 days 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 ...