A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State.
Ken HiguchiMitsuo WakatsukiEtsuji TomitaPublished in: IEICE Trans. Inf. Syst. (1995)
Keyphrases
- real time
- computational complexity
- finite state automaton
- experimental evaluation
- learning algorithm
- worst case
- cost function
- objective function
- optimization algorithm
- k means
- np hard
- computational cost
- optimal solution
- high accuracy
- matching algorithm
- clustering method
- detection algorithm
- convergence rate
- expectation maximization
- recognition algorithm
- preprocessing
- dynamic programming
- moving target
- randomized algorithm
- approximation ratio
- segmentation algorithm
- strongly polynomial
- control system
- particle swarm optimization
- special case
- significant improvement