356 search results - page 40 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
WADS
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
ICIAR
2005
Springer
14 years 1 months ago
2005
Springer
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...
SCHEDULING
2008
13 years 7 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...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
TCS
2010
13 years 2 months ago
2010
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...