Sciweavers

7133 search results - page 62 / 1427
» Communication algorithms with advice
Sort
View
WASA
2009
Springer
132views Algorithms» more  WASA 2009»
14 years 3 months ago
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
Peng-Jun Wan, Zhu Wang, Zhiyuan Wan, Scott C.-H. H...
ICDCN
2011
Springer
13 years 8 days ago
Mining Frequent Subgraphs to Extract Communication Patterns in Data-Centres
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...
Maitreya Natu, Vaishali P. Sadaphal, Sangameshwar ...
ANTSW
2010
Springer
13 years 3 months ago
Short and Robust Communication Paths in Dynamic Wireless Networks
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
Yoann Pigné, Frédéric Guinand
SPAA
2010
ACM
13 years 9 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
SODA
2010
ACM
173views Algorithms» more  SODA 2010»
14 years 6 months ago
Distributed Agreement with Optimal Communication Complexity
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
Seth Gilbert, Dariusz Kowalski