## Abstract

We consider scenarios where a sequence of tests is to be applied to an object, such that one outcome of a test may be a decision to terminate the sequence (e.g. deciding that the object is faulty) without running additional tests. One seeks an ordering of the tests that is minimal in expected resource consumption. In prior work, we examined conditions under which statistically independent test sequences can be optimized under precedence constraints. This paper examines conditions under which one can efficiently find an optimal ordering of tests with statistical dependencies. We show that with dependencies the optimization problem is NP-hard in the general case, and provide low-order polynomial time algorithms for special cases with non-trivial dependency structures.

Original language | English |
---|---|

Pages (from-to) | 17-31 |

Number of pages | 15 |

Journal | Discrete Applied Mathematics |

Volume | 226 |

DOIs | |

State | Published - 31 Jul 2017 |

## Keywords

- Object detection
- Test ordering problem

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics