Pages that link to "Item:Q5637903"
From MaRDI portal
The following pages link to Optimal Binary Identification Procedures (Q5637903):
Displaying 28 items.
- Decision trees with minimum average depth for sorting eight elements (Q266840) (← links)
- Diagnosis of three types of constant faults in read-once contact networks over finite bases (Q278720) (← links)
- Totally optimal decision trees for Boolean functions (Q323025) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- A binary decision algorithm (Q917292) (← links)
- A note on data structures for maintaining bipartitions (Q924550) (← links)
- Performance bounds for binary testing with arbitrary weights (Q1083851) (← links)
- Constructing optimal binary decision trees is NP-complete (Q1228355) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions (Q1694833) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Sequential testing of complex systems: a review (Q1878412) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- Algorithms for optimal dyadic decision trees (Q1959591) (← links)
- Diagnosis of constant faults in read-once contact networks over finite bases (Q2341754) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Hierarchical testing designs for pattern recognition (Q2569238) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Diagnosis of constant faults in iteration-free circuits over monotone basis (Q2636825) (← links)
- Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
- (Q5054624) (← links)
- Point probe decision trees for geometric concept classes (Q5060103) (← links)
- On Polynomial Time Constructions of Minimum Height Decision Tree (Q5091026) (← links)
- Optimization and analysis of decision trees and rules: dynamic programming approach (Q5326154) (← links)
- Optimal binary search trees (Q5906917) (← links)
