2084 search results - page 277 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
143
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
163
click to vote
DCOSS
2006
Springer
15 years 8 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
154
click to vote
TSP
2010
14 years 11 months ago
2010
Abstract--This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit, a setting typically encountered in sensor n...
118
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
170
click to vote
JSS
2007
15 years 5 months ago
2007
The resource management in distributed real-time systems becomes increasingly unpredictable with the proliferation of data-driven applications. Therefore, it is inefficient to all...