Login / Signup
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities.
James H. Hester
Daniel S. Hirschberg
Lawrence L. Larmore
Published in:
J. Algorithms (1988)
Keyphrases
</>
dynamic programming
access control
binary tree
decision trees
binary trees
reinforcement learning
optimal solution
probability distribution
asymptotically optimal
data sets
closed form
binary search trees
tree construction
random access
minimum cost
belief networks
learning algorithm