Generalizing the improved run-time complexity algorithm for non-dominated sorting.
Félix-Antoine FortinSimon GrenierMarc ParizeauPublished in: GECCO (2013)
Keyphrases
- improved algorithm
- worst case
- computational complexity
- computational cost
- times faster
- np hard
- cost function
- recognition algorithm
- optimization algorithm
- optimal solution
- matching algorithm
- learning algorithm
- linear complexity
- experimental evaluation
- space complexity
- clustering method
- detection algorithm
- probabilistic model
- decision problems
- theoretical analysis
- computationally efficient
- input data
- linear programming
- preprocessing
- objective function
- convergence rate
- lower complexity
- estimation algorithm
- single pass
- neural network
- memory requirements
- path planning
- segmentation method
- segmentation algorithm
- high accuracy
- dynamic programming
- k means
- genetic algorithm