An efficient algorithm for range computation of polynomials using the Bernstein form.
Shashwati RayP. S. V. NatarajPublished in: J. Glob. Optim. (2009)
Keyphrases
- least squares
- improved algorithm
- computationally efficient
- optimization algorithm
- experimental evaluation
- objective function
- theoretical analysis
- detection algorithm
- significant improvement
- learning algorithm
- high accuracy
- dynamic programming
- cost function
- k means
- selection algorithm
- matching algorithm
- preprocessing
- computational complexity
- convex hull
- wide range
- optimal solution
- times faster
- computational cost
- particle swarm optimization
- worst case
- np hard
- search space
- memory efficient
- simulated annealing
- recognition algorithm
- hardware implementation
- highly efficient
- parallel algorithm
- computational efficiency
- classification algorithm
- tree structure
- linear programming
- association rules
- data structure
- image processing