Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
From MaRDI portal
Publication:5560709
DOI10.1145/321341.321343zbMath0173.19505OpenAlexW2054275687WikidataQ129864243 ScholiaQ129864243MaRDI QIDQ5560709
L. T. Reinwald, Richard M. Soland
Publication date: 1966
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321341.321343
Related Items
An optimum testing algorithm for some symmetric coherent systems ⋮ Sequential testing of complex systems: a review ⋮ Performance bounds for binary testing with arbitrary weights ⋮ Decision tree design by simulated annealing ⋮ Some problems in discrete optimization ⋮ Algorithms for fast evaluation of Boolean expressions ⋮ A branch and bound algorithm for minimizing the expected cost of testing coherent systems ⋮ A binary decision algorithm ⋮ Algorithms for optimal dyadic decision trees ⋮ Reduction of dimensionality of an optimal decision table conversion algorithm ⋮ A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions ⋮ Computer science and decision theory ⋮ Efficient decision tree design for discrete variable pattern recognition problems
