Pages that link to "Item:Q3188997"
From MaRDI portal
The following pages link to Decision trees for entity identification (Q3188997):
Displayed 11 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← 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)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Decision-theoretic troubleshooting: hardness of approximation (Q2440184) (← links)
- Average-Case Active Learning with Costs (Q3648749) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)