A dual algorithm for the minimum covering weighted ball problem in $${\mathbb{R}^n}$$.
P. M. DearingAndrea M. SmithPublished in: J. Glob. Optim. (2013)
Keyphrases
- computational cost
- dynamic programming
- detection algorithm
- learning algorithm
- experimental evaluation
- preprocessing
- times faster
- classification algorithm
- similarity measure
- tree structure
- theoretical analysis
- gradient projection
- improved algorithm
- significant improvement
- selection algorithm
- np hard
- computational complexity
- computationally efficient
- segmentation algorithm
- expectation maximization
- path planning
- ant colony optimization
- data sets
- input data
- simulated annealing
- mobile robot
- optimal solution
- data structure
- cost function
- k means
- search space