Sciweavers

6095 search results - page 57 / 1219
» Learning in Local Search
Sort
View
CPAIOR
2004
Springer
14 years 2 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
TIME
2002
IEEE
14 years 1 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 9 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 5 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 10 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