199 search results - page 13 / 40 » Complexity of two dual criteria scheduling problems |
FAST
2007
13 years 9 months ago
2007
Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
RTCSA
2000
IEEE
14 years 3 days ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
TCOM
2008
13 years 7 months ago
2008
We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must sat...
WSC
2007
13 years 10 months ago
2007
Surgical services require the coordination of many activities, including patient check-in and surgical preparation, surgery, and recovery after surgery. Each of these activities r...
EOR
2008
13 years 7 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...