Sciweavers

4075 search results - page 211 / 815
» Modeling Distributed Algorithm Using B
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
MMB
2010
Springer
185views Communications» more  MMB 2010»
15 years 8 months ago
Reducing the Cost of Generating APH-Distributed Random Numbers
Phase-type (PH) distributions are proven to be very powerful tools in modelling and analysis of a wide range of phenomena in computer systems. The use of these distributions in sim...
Philipp Reinecke, Miklós Telek, Katinka Wol...
INFOCOM
2005
IEEE
16 years 5 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
DCOSS
2006
Springer
15 years 10 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
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...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
16 years 23 days ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio