29908 search results - page 40 / 5982 » On the complexity of communication complexity |
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—In the past years, electronic routers have had trouble keeping up with the increase in optical fiber capacity. As their power consumption has grown exponentially and already ex...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
VTC
2006
IEEE
14 years 4 months ago
2006
IEEE
— The literature of up-link SDMA systems is rich, but at the time of writing there is a paucity of information on the employment of SDMA techniques in the down-link. Hence, in th...