1095 search results - page 17 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
ESA
2003
Springer
15 years 2 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
102
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
RTSS
1999
IEEE
15 years 2 months ago
1999
IEEE
Many scheduling paradigms have been studied for realtime applications and real-time communication network. Among them, the most commonly used paradigms include priority-driven, ti...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...