Sciweavers

729 search results - page 4 / 146
» A Transitive Closure Based Algorithm for Test Generation
Sort
View
DAC
2004
ACM
13 years 11 months ago
On test generation for transition faults with minimized peak power dissipation
This paper presents a method of generating tests for transition faults using tests for stuck-at faults such that the peak power is the minimum possible using a given set of tests ...
Wei Li, Sudhakar M. Reddy, Irith Pomeranz
EUROCAST
2009
Springer
132views Hardware» more  EUROCAST 2009»
14 years 2 months ago
Separation of Transitions, Actions, and Exceptions in Model-Based Testing
Model-based testing generates test cases from a high-level model. Current models employ extensions to finite-state machines. This work proposes a separation of transitions in the ...
Cyrille Artho
VTS
2002
IEEE
120views Hardware» more  VTS 2002»
14 years 13 days ago
Software-Based Weighted Random Testing for IP Cores in Bus-Based Programmable SoCs
We present a software-based weighted random pattern scheme for testing delay faults in IP cores of programmable SoCs. We describe a method for determining static and transition pr...
Madhu K. Iyer, Kwang-Ting Cheng
IDA
2009
Springer
13 years 5 months ago
Efficient Vertical Mining of Frequent Closures and Generators
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...