1424 search results - page 182 / 285 » The Multi-radius Cover Problem |
137
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
143
click to vote
JSA
2000
15 years 2 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
122
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
109
click to vote
NSDI
2008
15 years 5 months ago
2008
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
149
click to vote
SODA
2010
ACM
15 years 29 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...