524 search results - page 103 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
EDCC
2010
Springer
14 years 13 days ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
WSNA
2003
ACM
14 years 27 days ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...