Sciweavers

975 search results - page 54 / 195
» Locality Optimization for Program Instances
Sort
View
IDEAS
2009
IEEE
129views Database» more  IDEAS 2009»
14 years 7 months ago
Speeding-up data-driven applications with program summaries
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Sonia Guehis, Virginie Goasdoué-Thion, Phil...
ANOR
2002
99views more  ANOR 2002»
14 years 9 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
15 years 2 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
ICASSP
2011
IEEE
14 years 1 months ago
RSS-based sensor localization with unknown transmit power
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
Reza M. Vaghefi, Mohammad Reza Gholami, Erik G. St...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 1 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...