Sciweavers

2714 search results - page 61 / 543
» Approximation Schemes for Scheduling
Sort
View
MM
1997
ACM
118views Multimedia» more  MM 1997»
15 years 4 months ago
BubbleUp: Low Latency Fast-Scan for Media Servers
Interactive multimediaapplicationsrequire fast response time. Traditional disk scheduling schemes can incur high latencies, and caching data in memory to reduce latency is usually...
Edward Y. Chang, Hector Garcia-Molina
96
Voted
CISS
2008
IEEE
15 years 7 months ago
Rate adaptation via link-layer feedback for goodput maximization over a time-varying channel
Abstract—We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless ch...
Rohit Aggarwal, Phil Schniter, Can Emre Koksal
CP
2005
Springer
15 years 6 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
88
Voted
WSC
2007
15 years 2 months ago
The optimizing-simulator: merging simulation and optimization using approximate dynamic programming
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
Warren B. Powell
CORR
2010
Springer
231views Education» more  CORR 2010»
14 years 10 months ago
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks
Scheduling is a critical and challenging resource allocation mechanism for multi-hop wireless networks. It is well known that scheduling schemes that give a higher priority to the ...
Bo Ji, Changhee Joo, Ness B. Shroff