Sciweavers

7133 search results - page 66 / 1427
» Communication algorithms with advice
Sort
View
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 8 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
JAIR
1998
195views more  JAIR 1998»
13 years 8 months ago
AntNet: Distributed Stigmergetic Control for Communications Networks
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo syst...
Gianni Di Caro, Marco Dorigo
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
RoboCast: Asynchronous Communication in Robot Networks
Abstract. This paper introduces the RoboCast communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors...
Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru, ...
INFOCOM
2011
IEEE
13 years 16 days ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
14 years 27 days ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry