Sciweavers

5580 search results - page 4 / 1116
» Randomized priority algorithms
Sort
View
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
14 years 2 days ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
RTSS
2007
IEEE
14 years 1 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
RTS
2011
176views more  RTS 2011»
12 years 10 months ago
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
Robert I. Davis, Alan Burns
COMPUTING
2008
94views more  COMPUTING 2008»
13 years 7 months ago
Two new methods for constructing double-ended priority queues from priority queues
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
13 years 12 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri