An efficient algorithm to construct disjoint path covers of DCell networks.
Xi WangJianxi FanXiaohua JiaCheng-Kuan LinPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- dynamic programming
- optimization algorithm
- objective function
- experimental evaluation
- path planning
- times faster
- learning algorithm
- high accuracy
- computational cost
- cost function
- computational complexity
- significant improvement
- k means
- optimal path
- particle swarm optimization
- theoretical analysis
- optimal solution
- matching algorithm
- search space
- worst case
- detection algorithm
- path finding
- segmentation algorithm
- computationally efficient
- pairwise
- similarity measure