Sciweavers

564 search results - page 6 / 113
» Lazy Code Motion
Sort
View
IFL
1999
Springer
108views Formal Methods» more  IFL 1999»
15 years 2 months ago
Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
John H. G. van Groningen
CG
2006
Springer
14 years 9 months ago
A dynamic bounding volume hierarchy for generalized collision detection
In this paper, we propose a new dynamic and efficient bounding volume hierarchy for breakable objects undergoing structured and/or unstructured motion. Our object
Thomas Larsson, Tomas Akenine-Möller
CODES
2000
IEEE
15 years 2 months ago
Task response time optimization using cost-based operation motion
We present a technique for task response time improvement based on the concept of code motion from the software domain. Relaxed Operation Motion (ROM) is a simple yet powerful app...
Bassam Tabbara, Abdallah Tabbara, Alberto L. Sangi...
PPPJ
2009
ACM
15 years 4 months ago
Lazy continuations for Java virtual machines
Continuations, or ’the rest of the computation’, are a concept that is most often used in the context of functional and dynamic programming languages. Implementations of such ...
Lukas Stadler, Christian Wimmer, Thomas Würth...
ICPPW
2009
IEEE
15 years 4 months ago
Just-in-Time Renaming and Lazy Write-Back on the Cell/B.E.
— Cell Superscalar (CellSs) provides a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E.) that automatically exploits the inherent concurre...
Pieter Bellens, Josep M. Pérez, Rosa M. Bad...