Max-throughput for (conservative) \(k\)-of-\(n\) testing
type: Item
instance of: scholarly article
title: Max-throughput for (conservative) \(k\)-of-\(n\) testing
zbMATH Open document ID: 1359.68134
author: Lisa Hellerstein
author: Özgür Özkan
author: Linda Sellie
published in: Algorithmica
publication date: 2017-03-03T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 6691866
zbMATH Keywords: \(k\)-of-\(n\) testing
zbMATH Keywords: maximum throughput
zbMATH Keywords: sequential testing
MaRDI profile type: Publication
full work available at URL: s00453-015-0089-4
OpenAlex ID: W1674070129
cites work: Optimal Testing Procedures for Special Structures of Coherent Systems
cites work: Diagnosing double regular systems
cites work: Algorithms for distributional and adversarial pipelined filter ordering problems
cites work: Heuristic least-cost computation of discrete classification functions with uncertain argument values
cites work: Parallel pipelined filter ordering with precedence constraints
cites work: Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
cites work: Optimal task sequencing with precedence constraints
cites work: Learning with attribute costs
cites work: Q4537700
cites work: An optimum testing algorithm for some symmetric coherent systems
cites work: Q3358267
cites work: Sequential testing of complex systems: a review
DOI: 10.1007/S00453-015-0089-4
description: scientific article; zbMATH DE number 6691866