493 search results - page 38 / 99 » Final exam scheduler - FES |
106
Voted
JCO
2000
15 years 11 days ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
95
Voted
MST
2002
15 years 7 days ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
96
Voted
HPCA
2004
IEEE
16 years 28 days ago
2004
IEEE
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...
118
click to vote
GROUP
2005
ACM
15 years 6 months ago
2005
ACM
This study investigates the role of rhythms in the collaborative coordination of mobile work as well as in the individual actors’ comprehension and command of their work. Drawin...
96
Voted
SACRYPT
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...