Sciweavers

1292 search results - page 231 / 259
» Revisiting the optimal scheduling problem
Sort
View
IOR
2002
135views more  IOR 2002»
14 years 9 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
IAT
2010
IEEE
14 years 7 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
VLSID
2002
IEEE
131views VLSI» more  VLSID 2002»
15 years 10 months ago
Divide-and-Conquer IDDQ Testing for Core-Based System Chips
IDDQ testing has been used as a test technique to supplement voltage testing of CMOS chips. The idea behind IDDQ testing is to declare a chip as faulty if the steady-state current...
C. P. Ravikumar, Rahul Kumar
GLVLSI
2010
IEEE
156views VLSI» more  GLVLSI 2010»
15 years 2 months ago
A multi-level approach to reduce the impact of NBTI on processor functional units
NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture leve...
Taniya Siddiqua, Sudhanva Gurumurthi
EMO
2001
Springer
107views Optimization» more  EMO 2001»
15 years 2 months ago
Multi-objective Optimisation of Cancer Chemotherapy Using Evolutionary Algorithms
The main objectives of cancer treatment in general, and of cancer chemotherapy in particular, are to eradicate the tumour and to prolong the patient survival time. Traditionally, t...
Andrei Petrovski, John A. W. McCall