Optimal Diagnosis Procedures for k-out-of-n Structures
IEEE Transactions on Computers
Diagnosing double regular systems
Annals of Mathematics and Artificial Intelligence
The Throughput of Sequential Testing
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal testing algorithms for symmetric coherent systems.
Optimal testing algorithms for symmetric coherent systems.
Flow algorithms for two pipelined filter ordering problems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We define a variant of k -of-n testing that we call conservative k -of-n testing. We present a polynomial-time, combinatorial algorithm for maximizing the throughput of conservative k -of-n testing, in a parallel setting. This extends previous work of Kodialam and Condon et al. on the parallel pipelined filter ordering problem, which is the special case where k =1 (or k =n ) [1,2,3]. We also consider the problem of maximizing throughput for standard k -of-n testing, and describe a polynomial-time algorithm for it based on the ellipsoid method.