247 search results - page 28 / 50 » Optimal Preemptive Scheduling for General Target Functions |
157
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
112
Voted
SCHEDULING
2008
15 years 3 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
125
click to vote
SENSYS
2003
ACM
15 years 8 months ago
2003
ACM
Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns. We present a practical real...
137
Voted
MM
2009
ACM
15 years 10 months ago
2009
ACM
As more and more video content is made available and accessed on-demand, content and service providers face challenges of scale. Today’s delivery mechanisms, especially unicast,...
130
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...