Sciweavers

1095 search results - page 13 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
KES
2006
Springer
14 years 9 months ago
Scheduling Jobs on Computational Grids Using Fuzzy Particle Swarm Algorithm
Abstract. Grid computing is a computing framework to meet the growing computational demands. This paper introduces a novel approach based on Particle Swarm Optimization (PSO) for s...
Ajith Abraham, Hongbo Liu, Weishi Zhang, Tae-Gyu C...
CPAIOR
2007
Springer
15 years 3 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
VLSID
2002
IEEE
192views VLSI» more  VLSID 2002»
15 years 2 months ago
Static and Dynamic Variable Voltage Scheduling Algorithms for Real-Time Heterogeneous Distributed Embedded Systems
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
Jiong Luo, Niraj K. Jha
TOCS
2008
154views more  TOCS 2008»
14 years 9 months ago
Adaptive work-stealing with parallelism feedback
We present an adaptive work-stealing thread scheduler, ASTEAL, for fork-join multithreaded jobs, like those written using the Cilk multithreaded language or the Hood work-stealing...
Kunal Agrawal, Charles E. Leiserson, Yuxiong He, W...
ICML
2006
IEEE
15 years 10 months ago
Efficient lazy elimination for averaged one-dependence estimators
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
Fei Zheng, Geoffrey I. Webb