Approximating the zeros of analytic functions by the exclusion algorithm.
Jean-Claude YakoubsohnPublished in: Numer. Algorithms (1994)
Keyphrases
- computational complexity
- cost function
- improved algorithm
- learning algorithm
- matching algorithm
- dynamic programming
- single pass
- detection algorithm
- classification algorithm
- times faster
- experimental evaluation
- multiresolution
- search space
- preprocessing
- significant improvement
- computational cost
- convex hull
- path planning
- objective function
- optimization algorithm
- experimental study
- selection algorithm
- convergence rate
- simulated annealing
- theoretical analysis
- computationally efficient
- particle swarm optimization
- linear programming
- high accuracy
- worst case
- k means
- similarity measure
- image processing