3934 search results - page 11 / 787 » Approximate Schedulability Analysis |
ECRTS
2008
IEEE
13 years 10 months ago
2008
IEEE
The schedulability testing for the deferrable scheduling algorithm for fixed priority transactions (DS-FP) remains
DISOPT
2006
13 years 8 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
IESS
2007
Springer
14 years 2 months ago
2007
Springer
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
TON
2010
13 years 3 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...