Sciweavers

44 search results - page 3 / 9
» A memory-layout oriented run-time technique for locality opt...
Sort
View
JUCS
2007
84views more  JUCS 2007»
13 years 5 months ago
Optimized Compilation of Around Advice for Aspect Oriented Programs
: The technology that supports Aspect-Oriented Programming (AOP) tools is inherently intrusive, since it changes the behavior of base application code. Advice weaving performed by ...
Eduardo S. Cordeiro, Roberto da Silva Bigonha, Mar...
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
13 years 9 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
FOCS
2008
IEEE
14 years 3 hour ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
DCOSS
2011
Springer
12 years 5 months ago
A distributed information fusion method for localization based on Pareto optimization
—To overcome the limitations of specific positioning techniques for mobile wireless nodes and achieve a high accuracy, the fusion of heterogeneous sensor information is an appea...
Alessio De Angelis, Carlo Fischione
PPL
2010
117views more  PPL 2010»
13 years 9 days ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...