Pages that link to "Item:Q918437"
From MaRDI portal
The following pages link to Heuristic least-cost computation of discrete classification functions with uncertain argument values (Q918437):
Displaying 13 items.
- Max-throughput for (conservative) \(k\)-of-\(n\) testing (Q513287) (← links)
- Evaluation of monotone DNF formulas (Q521804) (← links)
- Optimal resource allocation for security in reliability systems (Q877056) (← links)
- Testing systems of identical components (Q995929) (← links)
- Heuristic testing procedures for general coherent systems (Q1309933) (← links)
- Incorporating statistical information into expert classification systems to reduce classification costs (Q1356192) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints (Q1961459) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- The stochastic Boolean function evaluation problem for symmetric Boolean functions (Q2065798) (← links)
- Sequential testing in batches (Q2399312) (← links)
- A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems (Q5080670) (← links)
- Optimal classification trees (Q5915854) (← links)
