720 search results - page 12 / 144 » Broadcast scheduling: algorithms and complexity |
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—In this paper, we study the downlink precoding schemes for MIMO Gaussian broadcast channels (MIMO GBC). A novel low-complexity zero-forcing dirty-paper-coding (DPC) scheme, name...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
SIROCCO
1998
14 years 11 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
151
click to vote
DCOSS
2011
Springer
13 years 10 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...