457 search results - page 41 / 92 » Decay-Usage Scheduling in Multiprocessors |
DAM
2006
15 years 17 days ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
ORL
2006
15 years 14 days ago
2006
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
117
click to vote
IJCSA
2007
15 years 14 days ago
2007
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
78
Voted
ALGORITHMICA
2002
15 years 12 days ago
2002
78
Voted
JISE
2010
14 years 7 months ago
2010