Sequential testing of complex systems: a review
From MaRDI portal
Publication:1878412
DOI10.1016/j.dam.2002.08.001zbMath1077.68541OpenAlexW2031264603MaRDI QIDQ1878412
Publication date: 19 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2002.08.001
Related Items
Optimal ordering of statistically dependent tests ⋮ Sequencing unreliable jobs on parallel machines ⋮ Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ Sequential testing in batches ⋮ A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Scheduling modular projects on a bottleneck resource ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Unnamed Item ⋮ Scenario Submodular Cover ⋮ The list scheduling algorithm for scheduling unreliable jobs on two parallel machines ⋮ Scheduling results applicable to decision-theoretic troubleshooting ⋮ Time-critical testing and search problems ⋮ Max-throughput for (conservative) \(k\)-of-\(n\) testing ⋮ Evaluation of monotone DNF formulas ⋮ Moments and distribution of the net present value of a serial project ⋮ Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods ⋮ Simultaneous testing of multicharacteristic components ⋮ Minimizing the average searching time for an object within a graph ⋮ Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests ⋮ Testing systems of identical components ⋮ Optimal ordering of independent tests with precedence constraints ⋮ The stochastic Boolean function evaluation problem for symmetric Boolean functions ⋮ A note on ``optimal resource allocation for security in reliability systems ⋮ Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems ⋮ Algorithms for the unit-cost stochastic score classification problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
- Optimum decision trees - an optimal variable theorem and its related applications
- Diagnosing multiple faults
- A theory of diagnosis from first principles
- Controlling backward inference
- Sequencing with general precedence constraints
- A branch and bound algorithm for minimizing the expected cost of testing coherent systems
- Finding optimal derivation strategies in redundant knowledge bases
- A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
- Optimal problem-solving search: All-or-none solutions
- Constructing optimal binary decision trees is NP-complete
- An optimal sequence in multicharacteristic inspection
- Heuristic testing procedures for general coherent systems
- Optimal ordering policy of a sequencing model
- Incorporating statistical information into expert classification systems to reduce classification costs
- Question-asking strategies for Horn clause systems
- A cost effective question-asking strategy for Horn clause systems
- Performance bounds on the splitting algorithm for binary testing
- Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
- Diagnosing double regular systems
- Complexity of identification and dualization of positive Boolean functions
- Quiz show problems
- Optimal task sequencing with precedence constraints
- Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms
- Criteria for selecting a variable in the construction of efficient decision trees
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Sequencing with Series-Parallel Precedence Constraints
- Optimal Testing Procedures for Special Structures of Coherent Systems
- An optimal evaluation of Boolean expressions in an online query system
- Optimal inspection and repair of renewable coherent systems with independent components and constant failure rates
- Branching Programs and Binary Decision Diagrams
- Evaluating Boolean function with random variables
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
- Technical Note—Minimizing a Function of Permutations of n Integers
- Optimal Binary Identification Procedures
- Simple Binary Identification Problems
- Information theory applied to the conversion of decision tables to computer programs
