21 search results - page 2 / 5 » Test suite reduction and prioritization with call trees |
104
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
82
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
ICSE
1994
IEEE-ACM
15 years 4 months ago
1994
IEEE-ACM
This paper describes a system called TESTTUBE that combines static and dynamic analysis to perform selective retesting of software systems written in C. TESTTUBEfirst identifies w...
105
Voted
ITC
2003
IEEE
15 years 5 months ago
2003
IEEE
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
106
click to vote
PASTE
2004
ACM
15 years 5 months ago
2004
ACM
Test factoring creates fast, focused unit tests from slow systemwide tests; each new unit test exercises only a subset of the functionality exercised by the system tests. Augmenti...