16 search results - page 1 / 4 » Flattening Is an Improvement |
CAD
2008
Springer
13 years 5 months ago
2008
Springer
In many industries, products are constructed by assembled surface patches in 3, where each patch is expected to have an isometric map to a corresponding region in 2. The widely in...
LISP
2008
13 years 5 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
SAS
2000
Springer
13 years 8 months ago
2000
Springer
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
SC
1995
ACM
13 years 8 months ago
1995
ACM
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
AAAI
2000
13 years 6 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...