30 search results - page 6 / 6 » Analyzing the Scalability of Graph Algorithms on Eldorado |
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
PLDI
2009
ACM
14 years 2 days ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
PAM
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
WWW
2010
ACM
13 years 5 months ago
2010
ACM
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...