Sciweavers

2714 search results - page 95 / 543
» Approximation Schemes for Scheduling
Sort
View
126
Voted
JSAC
2007
129views more  JSAC 2007»
15 years 14 days ago
Content-Aware Resource Allocation and Packet Scheduling for Video Transmission over Wireless Networks
— A cross-layer packet scheduling scheme that streams pre-encoded video over wireless downlink packet access networks to multiple users is presented. The scheme can be used with ...
Peshala V. Pahalawatta, Randall Berry, Thrasyvoulo...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 6 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
EOR
2007
117views more  EOR 2007»
15 years 16 days ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
103
Voted
ECRTS
2006
IEEE
15 years 6 months ago
Task Reweighting under Global Scheduling on Multiprocessors
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson, UmaMaheswari C. De...
97
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang