An optimal sub array partitioning method based on directed graph path search.
Lian-qing YuHuan ZhuSi-ming LiYu-Hao YangPublished in: CISP-BMEI (2016)
Keyphrases
- directed graph
- search algorithm
- random walk
- strongly connected
- exhaustive search
- shortest path problem
- search space
- directed acyclic graph
- disjoint paths
- source node
- minimum cost
- dynamic programming
- search strategy
- search methods
- goal state
- graph properties
- graph structure
- learning algorithm
- undirected graph
- markov chain
- solution path
- optimal solution
- transition matrix
- reinforcement learning