Sciweavers

16404 search results - page 29 / 3281
» A set coverage problem
Sort
View
466
Voted

Presentation
945views
13 years 6 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
90
Voted
EDBT
2006
ACM
120views Database» more  EDBT 2006»
16 years 18 days ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
124
Voted
SSDBM
2008
IEEE
146views Database» more  SSDBM 2008»
15 years 6 months ago
Kriging for Localized Spatial Interpolation in Sensor Networks
Abstract. The presence of coverage holes can adversely affect the accurate representation of natural phenomena being monitored by a Wireless Sensor Network (WSN). Current WSN resea...
Muhammad Umer, Lars Kulik, Egemen Tanin
ICST
2010
IEEE
14 years 11 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
90
Voted
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
15 years 7 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod