16404 search results - page 45 / 3281 » A set coverage problem |
128
Voted
VTC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper proposes a new solution to the problem of self-deploying a network of wireless mobile robots with simultaneous consideration to several criteria, that are, the fault-tol...
94
Voted
ETS
2006
IEEE
15 years 6 months ago
2006
IEEE
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
78
Voted
ESEM
2009
ACM
15 years 7 months ago
2009
ACM
For empirical software engineering to reach its fullest potential, we must develop effective, experiential approaches to learning about it in a classroom setting. In this paper, ...
106
Voted
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
93
Voted
JCO
2006
15 years 15 days ago
2006
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...