An O (mn log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network.
Mehdi GhiyasvandPublished in: Telecommun. Syst. (2016)
Keyphrases
- learning algorithm
- preprocessing
- k means
- improved algorithm
- probabilistic model
- significant improvement
- times faster
- experimental evaluation
- optimization algorithm
- theoretical analysis
- objective function
- computational complexity
- input data
- growing neural gas
- minimal cost
- computationally efficient
- particle swarm optimization
- high accuracy
- dynamic programming
- expectation maximization
- linear programming
- worst case
- detection algorithm
- matching algorithm
- path planning
- benchmark problems
- recognition algorithm
- cost function
- network model
- optimal solution
- similarity measure