17 search results - page 3 / 4 » Distributed Calculation of PageRank Using Strongly Connected... |
MOBIHOC
2001
ACM
14 years 6 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
DSE
1998
13 years 6 months ago
1998
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
PLDI
2004
ACM
14 years 11 days 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...
ICFEM
2005
Springer
14 years 13 days ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
ECUMN
2007
Springer
14 years 1 months ago
2007
Springer
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...