Analysis of Algorithms: An Example of a Sort Algorithm.
Grzegorz BancerekPublished in: Formaliz. Math. (2013)
Keyphrases
- computational complexity
- learning algorithm
- times faster
- computationally efficient
- filtering algorithm
- synthetic and real world datasets
- computational efficiency
- single pass
- np hard
- worst case
- dynamic programming
- related algorithms
- empirical analyses
- preprocessing
- space complexity
- search space
- cost function
- synthetic and real datasets
- significant improvement
- computational cost
- k means
- computationally demanding
- data clustering
- memory requirements
- hybrid algorithm
- iterative algorithms
- algorithms require
- complexity analysis
- recently developed
- algorithm has been developed
- highly efficient
- exhaustive search
- neural network
- optimization algorithm
- probabilistic model
- benchmark problems
- particle swarm optimization
- pruning strategy
- provably convergent
- decision trees
- incremental version
- optimal solution
- multi objective
- simulated annealing
- optimization problems
- linear programming
- segmentation algorithm
- apriori algorithm
- combinatorial optimization
- synthetic datasets
- computationally intensive
- convergence rate
- solution quality