Sciweavers

5580 search results - page 5 / 1116
» Randomized priority algorithms
Sort
View
65
Voted
AIR
2004
130views more  AIR 2004»
14 years 9 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
CORR
2010
Springer
128views Education» more  CORR 2010»
14 years 9 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
PAMI
2002
154views more  PAMI 2002»
14 years 9 months ago
A Comparison of Algorithms for Connected Set Openings and Closings
Arnold Meijster, Michael H. F. Wilkinson
RTSS
2008
IEEE
15 years 4 months ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns
SODA
1996
ACM
102views Algorithms» more  SODA 1996»
14 years 11 months ago
On RAM Priority Queues
Mikkel Thorup