Sciweavers

2947 search results - page 287 / 590
» The timely token protocol
Sort
View
OPODIS
2007
15 years 8 months ago
The Cost of Monotonicity in Distributed Graph Searching
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
David Ilcinkas, Nicolas Nisse, David Soguet
MST
2006
136views more  MST 2006»
15 years 6 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ECCC
2010
98views more  ECCC 2010»
15 years 5 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
16 years 4 days ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
COMCOM
2008
99views more  COMCOM 2008»
15 years 6 months ago
Efficiently reconfigurable backbones for wireless sensor networks
We present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building ...
Stefano Basagni, Chiara Petrioli, Roberto Petrocci...