2924 search results - page 284 / 585 » Lower Bounds in Distributed Computing |
130
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
108
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
156
click to vote
DCOSS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Wireless sensor networks are often densely deployed for environmental monitoring applications. Collecting raw data from these networks can lead to excessive energy consum...
159
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
119
click to vote
ICDCS
1997
IEEE
15 years 8 months ago
1997
IEEE
Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applicati...