The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots.
Paola FlocchiniDebasish PattanayakNicola SantoroMasafumi YamashitaPublished in: IWOCA (2024)
Keyphrases
- preprocessing
- times faster
- experimental evaluation
- dynamic programming
- grouping algorithm
- computational complexity
- search space
- learning algorithm
- detection algorithm
- computational cost
- np hard
- fixed size
- improved algorithm
- global minimum
- neural network
- matching algorithm
- worst case time complexity
- k means
- significant improvement
- cost function
- robotic systems
- image segmentation
- optimal solution
- scales linearly
- space requirements
- space complexity
- particle swarm optimization
- convergence rate
- convex hull
- probabilistic model
- image registration
- clustering method
- input data
- theoretical analysis
- expectation maximization