254 search results - page 30 / 51 » On randomized one-round communication complexity |
ICN
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
ISOLA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a c...
PODC
2009
ACM
14 years 10 days ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...