513 search results - page 27 / 103 » Reduction Transformations in ORM |
140
click to vote
FOSSACS
2009
Springer
16 years 5 days ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
169
click to vote
PLDI
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents the design and implementation of a compiler algorithm that effectively optimizes programs for energy usage using dynamic voltage scaling (DVS). The algorithm ...
157
click to vote
DAC
2009
ACM
15 years 9 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
104
click to vote
PICS
2001
15 years 6 months ago
2001
Many old manuscript documents were written on both sides of the paper, and the bleed-through from one side of the document to the other increases the difficulty in reading or deci...
146
click to vote
ENTCS
2008
15 years 5 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...