Overcoming Complexity Catastrophe: An Algorithm for Beneficial Far-Reaching Adaptation under High Complexity.
Sasanka Sekhar ChandaSai YayavaramPublished in: CoRR (2021)
Keyphrases
- worst case
- computational complexity
- computational cost
- cost function
- matching algorithm
- np hard
- k means
- space complexity
- recognition algorithm
- improved algorithm
- high accuracy
- dynamic programming
- detection algorithm
- objective function
- optimization algorithm
- computationally efficient
- times faster
- convex hull
- selection algorithm
- convergence rate
- neural network
- simulated annealing
- significant improvement
- preprocessing
- optimal solution
- lower complexity
- complexity analysis
- high computational complexity
- linear complexity
- linear programming
- memory requirements
- path planning
- expectation maximization
- input data
- least squares
- experimental evaluation
- evolutionary algorithm
- search space
- learning algorithm