592 search results - page 4 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
CP
1998
Springer
13 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...
HEURISTICS
2000
13 years 6 months ago
2000
GECCO
2000
Springer
13 years 10 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
CVPR
2005
IEEE
14 years 8 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
NIPS
2007
13 years 7 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...