Login / Signup
Computing the Optimal IO Sequences of a Protocol in Polynomial Time.
Wen-Huei Chen
Chuan Yi Tang
Published in:
Inf. Process. Lett. (1991)
Keyphrases
</>
worst case
hidden markov models
dynamic programming
optimal planning
optimal solution
neural network
database systems
lower bound
special case
low cost
sequential patterns
approximation algorithms
highly efficient
efficient computation