12519 search results - page 142 / 2504 » Approximation Problems Categories |
132
click to vote
TPDS
2008
15 years 6 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
168
click to vote
SIAMMAX
2011
14 years 9 months ago
2011
This paper studies existence and uniqueness results and interlacing properties of nonlinear modifications of small rank of symmetric eigenvalue problems. Approximation properties ...
350
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
188
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
159
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...