Sciweavers

2212 search results - page 240 / 443
» Weighted control scheduling
Sort
View
CN
2002
117views more  CN 2002»
15 years 6 months ago
Achieving differentiated services through multi-class probabilistic priority scheduling
Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an...
Chen-Khong Tham, Qi Yao, Yuming Jiang
WG
2009
Springer
16 years 1 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
ICDM
2008
IEEE
145views Data Mining» more  ICDM 2008»
16 years 29 days ago
Paired Learners for Concept Drift
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
Stephen H. Bach, Marcus A. Maloof
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 8 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre