The following pages link to Learning with attribute costs (Q3581435):
Displaying 15 items.
- Max-throughput for (conservative) \(k\)-of-\(n\) testing (Q513287) (← links)
- Evaluation of monotone DNF formulas (Q521804) (← links)
- The hardness of the expected decision depth problem (Q845910) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Learning in the presence of finitely or infinitely many irrelevant attributes (Q1892203) (← links)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
- Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case (Q2275907) (← links)
- Optimal ordering of statistically dependent tests (Q2357770) (← links)
- Decision tree classification with bounded number of errors (Q2398501) (← links)
- Sequential testing in batches (Q2399312) (← links)
- Decision-theoretic troubleshooting: hardness of approximation (Q2440184) (← links)
- Scenario Submodular Cover (Q2971162) (← links)
- A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems (Q5080670) (← links)
- On competitive recommendations (Q5964063) (← links)
- Simple algorithms for stochastic score classification with small approximation ratios (Q6573003) (← links)
