Sciweavers

16404 search results - page 110 / 3281
» A set coverage problem
Sort
View
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
15 years 8 months ago
Bist Reseeding with very few Seeds
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
ISSRE
2002
IEEE
15 years 8 months ago
Fault Detection Capabilities of Coupling-based OO Testing
Object-oriented programs cause a shift in focus from software units to the way software classes and components are connected. Thus, we are finding that we need less emphasis on un...
Roger T. Alexander, Jeff Offutt, James M. Bieman
111
Voted
ICCAD
1996
IEEE
102views Hardware» more  ICCAD 1996»
15 years 7 months ago
Bit-flipping BIST
A scan-based BIST scheme is presented which guarantees complete fault coverage with very low hardware overhead. A probabilistic analysis shows that the output of an LFSR which fee...
Hans-Joachim Wunderlich, Gundolf Kiefer
ICALP
2007
Springer
15 years 9 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
SENSYS
2003
ACM
15 years 8 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...