Routing in Bidirectional k-ary n-cubes with the Red Rover Algorithm.
Jeffrey T. DraperFabrizio PetriniPublished in: PDPTA (1997)
Keyphrases
- experimental evaluation
- cost function
- learning algorithm
- k means
- improved algorithm
- computationally efficient
- detection algorithm
- convergence rate
- np hard
- optimization algorithm
- clustering method
- computational complexity
- matching algorithm
- input data
- computational cost
- theoretical analysis
- expectation maximization
- path planning
- preprocessing
- routing problem
- segmentation algorithm
- high accuracy
- dynamic programming
- search space
- optimal solution
- clustering algorithm