Proposal of flexible time-slot assignment algorithm for sub-λ switching network.
Keisuke OkamotoTatsuro TakahashiPublished in: ICOIN (2014)
Keyphrases
- cost function
- preprocessing
- detection algorithm
- theoretical analysis
- dynamic programming
- improved algorithm
- high accuracy
- computational cost
- experimental evaluation
- computational complexity
- objective function
- learning algorithm
- k means
- np hard
- optimal solution
- expectation maximization
- computationally efficient
- allocation strategy
- highly efficient
- optimal assignment
- network parameters
- network model
- genetic algorithm
- times faster
- worst case
- probabilistic model
- bayesian networks
- similarity measure