2714 search results - page 41 / 543 » Approximation Schemes for Scheduling |
83
Voted
MA
1999
Springer
15 years 4 months ago
1999
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support ef...
IPL
2007
15 years 10 days ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
CJ
2008
15 years 16 days ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
123
Voted
WIOPT
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
106
click to vote
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...