216 search results - page 9 / 44 » Covering Problems with Hard Capacities |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
DSN
2007
IEEE
14 years 1 months ago
2007
IEEE
Testing is a difficult process that becomes more difficult with scaling. With smaller and faster devices, tolerance for errors shrinks and devices may act correctly under certain ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
IWPEC
2004
Springer
14 years 26 days ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...