Sciweavers

2393 search results - page 50 / 479
» Bounds-Consistent Local Search
Sort
View
ICS
2005
Tsinghua U.
14 years 1 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
CP
2008
Springer
13 years 9 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 8 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
COMPGEOM
2009
ACM
14 years 2 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 1 months ago
Enhancing differential evolution performance with local search for high dimensional function optimization
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...
Nasimul Noman, Hitoshi Iba