Counterexample to the best-case running time of efficient non-dominated sorting algorithm.
Paras NigamSumit MishraPublished in: GECCO Companion (2022)
Keyphrases
- learning algorithm
- cost function
- detection algorithm
- theoretical analysis
- times faster
- dynamic programming
- single pass
- computationally efficient
- particle swarm optimization
- k means
- high efficiency
- np hard
- experimental evaluation
- highly efficient
- hardware implementation
- improved algorithm
- expectation maximization
- optimization algorithm
- high accuracy
- worst case
- significant improvement
- search space
- artificial neural networks
- computational complexity
- memory efficient
- simulated annealing
- pruning strategy
- optimal solution
- computationally intensive
- space complexity
- estimation algorithm
- data structure
- preprocessing
- selection algorithm
- recognition algorithm
- computational cost
- segmentation algorithm
- neural network