273 search results - page 29 / 55 » Improving program slicing with dynamic points-to data |
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
DALT
2008
Springer
14 years 11 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
WOMPAT
2001
Springer
15 years 2 months ago
2001
Springer
In contrast to the common belief that OpenMP requires data-parallel extensions to scale well on architectures with non-uniform memory access latency, recent work has shown that it ...
111
click to vote
CASES
2007
ACM
14 years 11 months ago
2007
ACM
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
TMI
2002
14 years 9 months ago
2002
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...