Max-throughput for (conservative) \(k\)-of-\(n\) testing

DOI10.1007/s00453-015-0089-4zbMath1359.68134OpenAlexW1674070129MaRDI QIDQ513287

Lisa Hellerstein, Özgür Özkan, Linda M. Sellie

Publication date: 3 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0089-4

zbMATH Keywords

maximum throughputsequential testing\(k\)-of-\(n\) testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests

Cites Work

• Heuristic least-cost computation of discrete classification functions with uncertain argument values
• An optimum testing algorithm for some symmetric coherent systems
• Sequential testing of complex systems: a review
• Diagnosing double regular systems
• Optimal task sequencing with precedence constraints
• Parallel pipelined filter ordering with precedence constraints
• Learning with attribute costs
• Optimal Testing Procedures for Special Structures of Coherent Systems
• Algorithms for distributional and adversarial pipelined filter ordering problems
• Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
• Unnamed Item
• Unnamed Item