1486 search results - page 142 / 298 » Algorithms for two-box covering |
138
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
158
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
142
click to vote
ICSAP
2010
15 years 8 months ago
2010
— When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field (referred to as a "cover"), while the rest of the sensors ...
118
click to vote
ASYNC
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
127
click to vote
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...