Sciweavers

162 search results - page 28 / 33
» A Relational Approach to the Compilation of Sparse Matrix Pr...
Sort
View
CGO
2008
IEEE
14 years 1 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
ICALP
1990
Springer
13 years 11 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...
MP
2008
99views more  MP 2008»
13 years 7 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
PADL
2012
Springer
12 years 3 months ago
Typing the Numeric Tower
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Fla...
DAC
2005
ACM
14 years 8 months ago
Locality-conscious workload assignment for array-based computations in MPSOC architectures
While the past research discussed several advantages of multiprocessor-system-on-a-chip (MPSOC) architectures from both area utilization and design verification perspectives over ...
Feihui Li, Mahmut T. Kandemir