717 search results - page 28 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
HEURISTICS
2002
14 years 9 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
HICSS
1994
IEEE
15 years 1 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
110
click to vote
AAAI
1996
14 years 11 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
HM
2009
Springer
15 years 2 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++ )....