515 search results - page 5 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
DAC
1996
ACM
13 years 11 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
DAC
2004
ACM
13 years 11 months ago
2004
ACM
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 ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
ICSE
2003
IEEE-ACM
14 years 16 days ago
2003
IEEE-ACM
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
IJAC
2007
13 years 7 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...