Minimum average cost testing for partially ordered components

DOI10.1109/18.370098MaRDI QIDQ4840895zbMATH OpenOpenAlexFDO

Authors Marc J. Lipman, Julia Abrahams

Publication date 6 November 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.370098

zbMATH Keywords

alphabetic coding problembinary testsfaulty componentpartial ordersvariable-length source codes

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• The Least Cost Testing Sequence Problem
• Minimum cost component test plans for evaluating reliability of a highly reliable parallel system
• Optimum component test plans for systems with dependent components
• Optimum component test plans for phased-mission systems
• Economically Optimum Acceptance Tests
• Average testing and Pareto efficiency

Cited in

(12)

• The binary identification problem for weighted trees
• A strategy for searching with different access costs.
• Optimal ordering of statistically dependent tests
• Improved approximation algorithms for the average-case tree searching problem
• Optimal ordering of tests with extreme dependencies
• Searching in random partially ordered sets
• An approximation algorithm for binary searching in trees
• On the complexity of searching in trees and partially ordered structures
• Old and new results on alphabetic codes
• Optimal ordering of independent tests with precedence constraints
• Edge ranking and searching in partial orders
• Testing systems of identical components

This page was built for publication: Minimum average cost testing for partially ordered components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840895)