440 search results - page 32 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
SETN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
AAAI
1994
13 years 9 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
MICAI
2004
Springer
14 years 1 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
FLAIRS
2004
13 years 9 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...