Sciweavers

314 search results - page 11 / 63
» The Complexity of Coverage
Sort
View
ICS
2003
Tsinghua U.
14 years 3 months ago
Selecting long atomic traces for high coverage
This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and...
Roni Rosner, Micha Moffie, Yiannakis Sazeides, Ron...
ICRA
2010
IEEE
150views Robotics» more  ICRA 2010»
13 years 8 months ago
Balancing state-space coverage in planning with dynamics
— Sampling-based kinodynamic planners, such as the popular RRT algorithm, have been proposed as promising solutions to planning for systems with dynamics. Nevertheless, complex s...
Yanbo Li, Kostas E. Bekris
DAC
1998
ACM
14 years 2 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
WINET
2011
13 years 4 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
VTC
2010
IEEE
177views Communications» more  VTC 2010»
13 years 8 months ago
Randomized Robot-Assisted Relocation of Sensors for Coverage Repair in Wireless Sensor Networks
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...