1024 search results - page 126 / 205 » Complexity and Performance in Parallel Programming Languages |
129
Voted
ICMT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
112
click to vote
OOPSLA
2009
Springer
15 years 9 months ago
2009
Springer
Modern object-oriented languages have complex features that cause programmers to overspecify their programs. This overspeciļ¬cation hinders automatic optimizers, since they must ...
244
Voted
POPL
2003
ACM
16 years 2 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
146
Voted
MSO
2003
15 years 3 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
113
click to vote
IWMM
2004
Springer
15 years 7 months ago
2004
Springer
Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high ...