An efficient graph algorithm for FSM scheduling.
Ti-Yen YenWayne H. WolfPublished in: IEEE Trans. Very Large Scale Integr. Syst. (1996)
Keyphrases
- dynamic programming
- tree structure
- cost function
- learning algorithm
- graph structure
- computational cost
- detection algorithm
- computationally efficient
- objective function
- k means
- significant improvement
- np hard
- scheduling strategy
- graph based algorithm
- minimum spanning tree
- segmentation algorithm
- expectation maximization
- preprocessing
- computational complexity
- search algorithm
- optimal solution
- ant colony optimization
- lower bound
- approximation algorithms
- spanning tree
- undirected graph
- job shop scheduling problem