1095 search results - page 52 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
149
click to vote
IEAAIE
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, a multi-objective genetic algorithm is proposed to deal with a real-world fuzzy job shop scheduling problem. Fuzzy sets are used to model uncertain due dates and pro...
115
click to vote
RTCSA
2008
IEEE
15 years 10 months ago
2008
IEEE
In an attempt to substitute NOR flash with NAND flash and provide more memory to applications, embedded systems have to use demand paging. However, demand paging drastically degra...
140
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Scheduling applications on wide-area distributed systems is useful for obtaining quick and reliable results in an efficient manner. Optimized scheduling algorithms are fundamental...
140
click to vote
ECRTS
2004
IEEE
15 years 7 months ago
2004
IEEE
Computing systems, ranging from small battery-operated embedded systems to more complex general purpose systems, are designed to satisfy various computation demands in some accept...
130
click to vote
ICCAD
2004
IEEE
16 years 29 days ago
2004
IEEE
— In deep sub-micron technologies, process variations can cause significant path delay and clock skew uncertainties thereby lead to timing failure and yield loss. In this paper,...