254 search results - page 37 / 51 » On randomized one-round communication complexity |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...