Sciweavers

5374 search results - page 189 / 1075
» The induction of communication protocols
Sort
View
ICC
2007
IEEE
119views Communications» more  ICC 2007»
16 years 27 days ago
Experimental Performance Comparison of Rate-based and Store-and-Forward Transmission Mechanisms over Error-Prone Cislunar Commun
—Some work has been done in evaluating the performance of the rate-based SCPS-Pure Rate Control and the store-and-forward CFDP protocol. In this paper, we present an experimental...
Ruhai Wang, Anil Ayyagari, Xuan Wu, Bo Sun, Wei Ta...
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
16 years 23 days ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
CN
2007
116views more  CN 2007»
15 years 6 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer
TSMC
2008
113views more  TSMC 2008»
15 years 6 months ago
Distributed Diagnosis Under Bounded-Delay Communication of Immediately Forwarded Local Observations
In this paper, we study distributed failure diagnosis under k-bounded communication delay, where each local site transmits its observations to other sites immediately after each o...
Wenbin Qiu, Ratnesh Kumar
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 9 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang