Heuristic least-cost computation of discrete classification functions with uncertain argument values

DOI10.1007/BF02022091zbMath0705.90089MaRDI QIDQ918437

Warren Kuehner, Louis Anthony jun. Cox, Yuping Qiu

Publication date: 1989

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Monte Carlo simulationcoherent systemsstatistical classificationdesign of interactive expert systemsheuristic sequential inspection procedurespath-sorting algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Sequential testing of complex systems: a review ⋮ Incorporating statistical information into expert classification systems to reduce classification costs ⋮ Sequential testing in batches ⋮ A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems ⋮ Optimal resource allocation for security in reliability systems ⋮ Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints ⋮ Max-throughput for (conservative) \(k\)-of-\(n\) testing ⋮ Evaluation of monotone DNF formulas ⋮ Optimal classification trees ⋮ Optimization problems for machine learning: a survey ⋮ Testing systems of identical components ⋮ The stochastic Boolean function evaluation problem for symmetric Boolean functions ⋮ Heuristic testing procedures for general coherent systems

Cites Work

• A branch and bound algorithm for minimizing the expected cost of testing coherent systems
• Disjoint Products and Efficient Computation of Reliability
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
• A Unified Approach to Path Problems
• Optimal Testing Procedures for Special Structures of Coherent Systems
• Technical Note—Fault Testing for a k-out-of-n System
• Some Reliability Fault-Testing Models
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristic least-cost computation of discrete classification functions with uncertain argument values