388 search results - page 34 / 78 » Robust Lower Bounds for Communication and Stream Computation |
151
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
122
click to vote
HOTI
2002
IEEE
15 years 11 months ago
2002
IEEE
A radio network is described for configuring, monitoring, and diagnosing the components of a computer system. Such a network offers several advantages: (a) it improves the robustn...
154
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
167
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
151
click to vote
CSFW
1996
IEEE
15 years 10 months ago
1996
IEEE
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...