2084 search results - page 176 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
137
click to vote
TC
2008
15 years 5 months ago
2008
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
182
click to vote
ICC
2009
IEEE
15 years 12 months ago
2009
IEEE
This work extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks to a dynamic framewor...
158
Voted
WG
2001
Springer
15 years 9 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
169
click to vote
DEDS
2010
15 years 2 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
168
click to vote
OPODIS
2010
15 years 3 months ago
2010
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...