Sciweavers

2393 search results - page 35 / 479
» Bounds-Consistent Local Search
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
CVPR
2010
IEEE
1413views Computer Vision» more  CVPR 2010»
14 years 4 months ago
Free-Shape Subwindow Search for Object Localization
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...
Zhiqi Zhang, Yu Cao, Dhaval Salvi, Kenton Oliver, ...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
SLS
2007
Springer
100views Algorithms» more  SLS 2007»
14 years 1 months ago
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
Abstract. We present a software tool, called EasySyn++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EasySyn++ uses C++ as ...
Luca Di Gaspero, Andrea Schaerf
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 1 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik