60 search results - page 8 / 12 » k-Center Problems with Minimum Coverage |
ITC
1995
IEEE
14 years 3 days ago
1995
IEEE
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...
IJRR
2011
13 years 3 months ago
2011
This paper unifies and extends several different existing strategies for deploying groups of robots in an environment. A cost function is proposed that can be specialized to rep...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
EDBT
2011
ACM
13 years 2 days ago
2011
ACM
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
MOBICOM
2006
ACM
14 years 2 months ago
2006
ACM
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...