975 search results - page 38 / 195 » Locality Optimization for Program Instances |
IFL
2004
Springer
2004
Springer
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
15 years 3 months ago
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
IEEEPACT
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
MP
2010
14 years 4 months ago
2010
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
LION
2007
Springer
15 years 3 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...