Sciweavers

720 search results - page 25 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
ICC
2007
IEEE
15 years 4 months ago
Trade-Offs of Spatial Gain for QoS-Guaranteed Services in the MIMO Broadcast Channels
— Although the capacity of multiple-input multiple output (MIMO) broadcast channels (BCs) can be achieved by dirty-paper coding (DPC), it is difficult to apply the results direct...
Seung Hwan Lee, John S. Thompson
TWC
2010
14 years 4 months ago
PIE: cooperative peer-to-peer information exchange in network coding enabled wireless networks
In this paper, we study the issue of scheduling transmission opportunities among nodes (peers) to achieve higher network throughput and lower transmission delay for network coding ...
Yanfei Fan, Yixin Jiang, Haojin Zhu, Xuemin Shen
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 2 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
GLOBECOM
2008
IEEE
14 years 11 months ago
User Selection for Multiple-Antenna Broadcast Channel with Zero-Forcing Beamforming
Abstract—This paper investigates the zero-forcing (ZF) beamforming transmit strategy in the multiple-antenna multiuser downlink systems. We consider the case of mobile users equi...
Saeed Kaviani, Witold A. Krzymien
SPAA
2006
ACM
15 years 4 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen