Optimal Diagnosis Procedures for k-out-of-n Structures
IEEE Transactions on Computers
Heuristic least-cost computation of discrete classification functions with uncertain argument values
Annals of Operations Research
An optimal sequence in multicharacteristics inspection
Journal of Optimization Theory and Applications
Finding optimal derivation in redundant knowledge bases
Artificial Intelligence
Guess-and-verify heuristics for reducing uncertainties in expert classification systems
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
Discrete Applied Mathematics
Max-throughput for (conservative) k-of-n testing
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Sequential testing policies for complex systems under precedence constraints
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
We consider the problem of testing sequentially the components of a multi‐component system, when the testing of each component is costly. We propose a new testing policy, that can be executed in polynomial time in the input size, and show that it is cost‐minimal in the average case sense, for certain double regular systems that include regular (in particular, threshold) systems with identical components. This result generalizes known results for series, parallel, and, more generally, for k‐out‐of‐n systems.