24 search results - page 3 / 5 » Automatic Complexity Analysis for Programs Extracted from Co... |
IPPS
1996
IEEE
13 years 10 months ago
1996
IEEE
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
ICDAR
2009
IEEE
14 years 21 days ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
ICSM
2003
IEEE
13 years 11 months ago
2003
IEEE
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
PLDI
2003
ACM
13 years 11 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...