Sciweavers

29908 search results - page 281 / 5982
» On the Complexity of
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— 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...
Chuanxiong Guo
INFOCOM
2007
IEEE
16 years 1 months ago
Optimal-Complexity Optical Router
—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...
Hadas Kogan, Isaac Keslassy
217
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— 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...
Longbi Lin, Xiaojun Lin, Ness B. Shroff
INFOCOM
2007
IEEE
16 years 1 months ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
VTC
2007
IEEE
139views Communications» more  VTC 2007»
16 years 29 days ago
A Low Complexity Frequency Domain Iterative Decision-Directed Channel Estimation Technique for Single-Carrier Systems
— A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pi...
Chan-Tong Lam, David D. Falconer, Florence Danilo-...