117 search results - page 13 / 24 » Run-Time Bytecode Specialization |
CSMR
2007
IEEE
14 years 4 months ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
LPAR
1999
Springer
14 years 1 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
TRIDENTCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Researchers use the PlanetLab testbed for its ability to host experimental applications in realistic conditions over the public besteffort internet. Such applications form overlays...
SIAMCOMP
2008
13 years 9 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...