Sciweavers

1053 search results - page 38 / 211
» On k-Path Covers and their applications
Sort
View
ICSE
2003
IEEE-ACM
14 years 9 months ago
Constructing Test Suites for Interaction Testing
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...
UIC
2007
Springer
14 years 3 months ago
A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
Ming Liu, Yuan Zheng, Jiannong Cao, Wei Lou, Guiha...
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
14 years 26 days ago
BddCut: Towards Scalable Symbolic Cut Enumeration
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
APN
2010
Springer
13 years 9 months ago
Forward Analysis for Petri Nets with Name Creation
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
Fernando Rosa Velardo, David de Frutos-Escrig
INFOCOM
2009
IEEE
14 years 3 months ago
Barrier Information Coverage with Wireless Sensors
Abstract—Sensor networks have been deployed for many barrier coverage applications such as intrusion detection and border surveillance. In these applications, it is critical to o...
Guanqun Yang, Daji Qiao