Sciweavers

2393 search results - page 355 / 479
» Bounds-Consistent Local Search
Sort
View
CP
2004
Springer
14 years 2 months ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
ECCV
2004
Springer
14 years 2 months ago
Human Detection Based on a Probabilistic Assembly of Robust Part Detectors
We describe a novel method for human detection in single images which can detect full bodies as well as close-up views in the presence of clutter and occlusion. Humans are modeled ...
Krystian Mikolajczyk, Cordelia Schmid, Andrew Ziss...
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
14 years 2 months ago
Hybrid Genetic Algorithms for Multi-Objective Optimisation of Water Distribution Networks
Abstract. Genetic algorithms have been a standard technique for engineers optimising water distribution networks for some time. However in recent years there has been an increasing...
Ed Keedwell, Soon-Thiam Khu
GECCO
2004
Springer
14 years 2 months ago
Non-stationary Subtasks Can Improve Diversity in Stationary Tasks
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
Christopher Willis-Ford, Terence Soule
MICAI
2004
Springer
14 years 2 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
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 ...
María Auxilio Osorio Lama, David Pinto