Sciweavers

975 search results - page 5 / 195
» Locality Optimization for Program Instances
Sort
View
ECOOP
2006
Springer
13 years 10 months ago
Statement Annotations for Fine-Grained Advising
AspectJ-like languages are currently ineffective at modularizing heterogeneous concerns that are tightly coupled to the source code of the base program, such as logging, invariant...
Marc Eaddy, Alfred V. Aho
EOR
2008
75views more  EOR 2008»
13 years 7 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
SAIG
2001
Springer
13 years 11 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
DAGSTUHL
2003
13 years 8 months ago
Program Optimization in the Domain of High-Performance Parallelism
I consider the problem of the domain-specific optimization of programs. I review different approaches, discuss their potential, and sketch instances of them from the practice of ...
Christian Lengauer
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
14 years 16 days ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
Bram De Wachter, Alexandre Genon, Thierry Massart