2924 search results - page 257 / 585 » Lower Bounds in Distributed Computing |
136
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
128
click to vote
CCCG
2010
15 years 5 months ago
2010
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
143
click to vote
DC
2007
2007
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
15 years 4 months ago
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
145
Voted
NETGAMES
2003
ACM
15 years 9 months ago
2003
ACM
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
165
Voted
ICNS
2006
IEEE
15 years 10 months ago
2006
IEEE
– Service-Oriented Programming Model is a new methodology for building service-oriented applications. In the Service-Oriented Programming Model, an application is assembled from ...