3934 search results - page 275 / 787 » Approximate Schedulability Analysis |
147
click to vote
SACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
DEAL is a six- or eight-round Luby-Rackoff cipher that uses DES as its round function, with allowed key lengths of 128, 192, and 256 bits. In this paper, we discuss two new result...
170
click to vote
SIGCOMM
1996
ACM
15 years 10 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
138
click to vote
EOR
2006
15 years 6 months ago
2006
In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required ope...
147
click to vote
MJ
2006
15 years 6 months ago
2006
The Hardware (HW)/Software (SW) partitioning/scheduling relies on two subtasks : the cost function and the real time (RT) analysis. Besides these two subtasks, the proposed generi...
153
click to vote
CLEIEJ
2004
15 years 6 months ago
2004
Optimizing the pump-scheduling is an interesting proposal to achieve cost reductions in water distribution pumping stations. As systems grow, pump-scheduling becomes a very diffic...