524 search results - page 88 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
EDBT
2006
ACM
13 years 11 months ago
2006
ACM
Abstract. In wireless data broadcast systems, popular information is repetitively disseminated through possibly multiple communication channels to mobile clients using various type...
INFOCOM
2000
IEEE
14 years 2 days ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
SIGECOM
2010
ACM
14 years 15 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...