Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

S. Kamal

dblp:89/4278 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1974
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
fault detection
0.011974
Intermittent Faults: A Model and a Detection Procedure · IEEE Trans. Computers 1974
Electronic design automation
hardware test
0.011974
Intermittent Faults: A Model and a Detection Procedure · IEEE Trans. Computers 1974
Electronic design automation › hardware verification and test › fault diagnosis
intermittent faults
0.011974
Intermittent Faults: A Model and a Detection Procedure · IEEE Trans. Computers 1974

Methods — techniques the papers use, named apart from their topics

sequential statistical decision · 0.0probabilistic fault model · 0.0integer programming · 0.0
YearPublicationVenuePosition
1974 Intermittent Faults: A Model and a Detection Procedure
abstract
Intermittent faults are those faults whose effects on the behavior of a system are present only part of the time. A probabilistic model for intermittent faults in digital circuits is suggested. A procedure for the detection of such faults in combinational circuits is proposed. The procedure employs the repeated application of tests that test for these faults as if their effects were permanent. The procedure is analogous to a sequential statistical decision problem. Least upper bounds on the number of repetitions of tests that detect a particular fault are derived. These bounds are then employed in designing optimum detection experiments. Such an optimization problem is found to be equivalent to an integer programming problem.
S. Kamal, Carl V. Page
IEEE Trans. Computers1