Sciweavers

1783 search results - page 3 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
COMCOM
2004
114views more  COMCOM 2004»
13 years 8 months ago
WFI optimized PWGPS for wireless IP networks
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
Fei Xiang, Alan Marshall, Junzhou Luo
JSAC
2008
110views more  JSAC 2008»
13 years 8 months ago
Low complexity resource allocation with opportunistic feedback over downlink OFDMA networks
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
Rajiv Agarwal, Vinay R. Majjigi, Zhu Han, Rath Van...
CCR
2004
110views more  CCR 2004»
13 years 8 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
ICALP
2009
Springer
14 years 8 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson