412 search results - page 19 / 83 » Parallel Machine Scheduling Problems with Controllable Proce... |
CEC
2003
IEEE
14 years 1 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
DEBS
2008
ACM
13 years 8 months ago
2008
ACM
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
TPDS
2002
13 years 6 months ago
2002
This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposit...
IPPS
2005
IEEE
14 years 10 days ago
2005
IEEE
Data flow and FSMs are used intensively to specify real-time systems in the field of mechatronics. Their implementation in FPGAs is discussed against the background of dynamic rec...