Sciweavers

13214 search results - page 2364 / 2643
» Pseudorandomness for network algorithms
Sort
View
ICC
2009
IEEE
144views Communications» more  ICC 2009»
16 years 1 months ago
Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays an...
Virag Shah, Neelesh B. Mehta, Raymond Yim
INFOCOM
2009
IEEE
16 years 1 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu
INFOCOM
2009
IEEE
16 years 1 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
SIGCOMM
2009
ACM
16 years 1 months ago
Economic issues in shared infrastructures
We define some interesting incentive issues that arise in the management of virtual infrastructures. We demonstrate that participants’ decisions about the quantities of infrast...
Costas Courcoubetis, Richard R. Weber
« Prev « First page 2364 / 2643 Last » Next »