Sciweavers

3934 search results - page 16 / 787
» Approximate Schedulability Analysis
Sort
View
TELSYS
2010
121views more  TELSYS 2010»
13 years 3 months ago
Packet level performance analysis of a packet scheduler exploiting multiuser diversity
In this paper, we consider a packet scheduler exploiting multiuser diversity in a wireless network with AMC (Adaptive Modulation and Coding), and propose a packet level performance...
Gang Uk Hwang, Fumio Ishizaki
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 9 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
SCHEDULING
2010
137views more  SCHEDULING 2010»
13 years 6 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...
WICON
2008
13 years 9 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
DFG
2009
Springer
14 years 3 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...