213 search results - page 2 / 43 » A comparison of search heuristics for empirical code optimiz... |
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
Empirical program optimizers estimate the values of key optimization parameters by generating different program versions and running them on the actual hardware to determine which...
LCPC
2005
Springer
13 years 10 months ago
2005
Springer
The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler...
HEURISTICS
2002
13 years 5 months ago
2002
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...