1882 search results - page 93 / 377 » Transformational Programming and Forests |
107
click to vote
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a new approach to improve performance of Java programs by extending the superthreaded speculative execution model [14, 15] to exploit coarsegrained parallelism...
CC
2000
Springer
15 years 2 months ago
2000
Springer
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
PPDP
2010
Springer
14 years 7 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
AGTIVE
2007
Springer
15 years 4 months ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
DAC
1996
ACM
15 years 2 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...