1095 search results - page 70 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
90
Voted
SC
2009
ACM
15 years 5 months ago
2009
ACM
Asymmetric (or Heterogeneous) Multiprocessors are becoming popular in the current era of multi-cores due to their power efficiency and potential performance and energy efficienc...
SACRYPT
2001
Springer
15 years 2 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...
103
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
EOR
2007
14 years 10 months ago
2007
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...