A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links.
Siamack AyandehPublished in: ICC (2002)
Keyphrases
- dynamic programming
- learning algorithm
- detection algorithm
- computational complexity
- times faster
- experimental evaluation
- expectation maximization
- worst case
- segmentation algorithm
- preprocessing
- search space
- cost function
- shortest path
- optimization algorithm
- computational cost
- recognition algorithm
- shortest path problem
- high accuracy
- probabilistic model
- np hard
- significant improvement
- optimal solution
- social networks