284 search results - page 17 / 57 » Distributed Agreement with Optimal Communication Complexity |
84
Voted
INFOCOM
1997
IEEE
15 years 3 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
106
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— There is a need for new spectrum access protocols that are opportunistic, flexible and efficient, yet fair. Game theory provides a framework for analyzing spectrum access, a ...
88
Voted
SSS
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
105
click to vote
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
122
click to vote
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...