Performance bounds for binary testing with arbitrary weights
- 1 April 1985
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (1) , 101-114
- https://doi.org/10.1007/bf00290148
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Activity of a Variable and Its Relation to Decision TreesACM Transactions on Programming Languages and Systems, 1980
- Identification Keys and Diagnostic Tables: A ReviewJournal of the Royal Statistical Society. Series A (General), 1980
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976
- Performance bounds on the splitting algorithm for binary testingActa Informatica, 1974
- Optimal Binary Identification ProceduresSIAM Journal on Applied Mathematics, 1972
- Simple Binary Identification ProblemsIEEE Transactions on Computers, 1972
- A Mathematical Model for Diagnosing System FailuresIEEE Transactions on Electronic Computers, 1967
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing TimeJournal of the ACM, 1966
- An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary DecisionsJournal of the ACM, 1964