Sciweavers

517 search results - page 81 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
WICON
2008
15 years 1 months ago
A fluid-flow model for backlog-based CSMA policies
We present a fluid flow model to analyze backlog-based CSMA policies. The model is obtained using a CSMA fixed point approximation that has been recently proposed and analyzed. We...
Atilla Eryilmaz, Peter Marbach, Asuman E. Ozdaglar
ANOR
2010
112views more  ANOR 2010»
14 years 10 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
BIRTHDAY
2009
Springer
15 years 3 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
FOCS
2007
IEEE
15 years 3 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
CN
2002
88views more  CN 2002»
14 years 11 months ago
Rate allocation and buffer management for differentiated services
A novel algorithm for buffer management and rate allocation is presented for providing loss and delay differentiation for traffic classes at a network router. The algorithm, calle...
Jörg Liebeherr, Nicolas Christin