Login / Signup

Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines.

Thomas N. Hibbard
Published in: J. ACM (1961)
Keyphrases
  • upper bound
  • lower bound
  • state space
  • artificial intelligence
  • case study
  • lower and upper bounds
  • decision trees
  • class labels
  • branch and bound
  • branch and bound algorithm
  • parallel machines
  • efficiently computable