579 search results - page 31 / 116 » New Hybrid Optimization Algorithms for Machine Scheduling Pr... |
120
click to vote
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
103
click to vote
DAC
1999
ACM
16 years 2 months ago
1999
ACM
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
122
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
113
click to vote
JCP
2008
15 years 1 months ago
2008
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
102
click to vote
ICPPW
2007
IEEE
15 years 8 months ago
2007
IEEE
P2P technology has been widely adopted in live streaming system for its scalability and low commercial cost. However, tree based system or mesh based system still has to face the ...