An Empirical Approach to Algorithm Analysis Resulting in Approximations to Big Theta Time Complexity.
John Paul GuzmanTeresita LimoancoPublished in: J. Softw. (2017)
Keyphrases
- worst case
- learning algorithm
- times faster
- detection algorithm
- computational complexity
- theoretical analysis
- np hard
- improved algorithm
- matching algorithm
- search space
- computationally efficient
- experimental evaluation
- particle swarm optimization
- linear complexity
- optimization algorithm
- linear programming
- complexity analysis
- dynamic programming
- k means
- preprocessing
- objective function
- space complexity
- computational cost
- data mining
- estimation algorithm
- optimal solution
- memory requirements
- recognition algorithm
- high computational complexity
- lower complexity
- closed form
- path planning
- input data
- high accuracy
- cost function
- search algorithm
- similarity measure