A polynomial time algorithm for unloading boxes off a gravity conveyor.
Pierre BaptisteAlain HertzAndré LinharesDjamal RebainePublished in: Discret. Optim. (2013)
Keyphrases
- experimental evaluation
- dynamic programming
- computational complexity
- preprocessing
- times faster
- cost function
- k means
- np hard
- theoretical analysis
- significant improvement
- computational cost
- learning algorithm
- simulated annealing
- path planning
- detection algorithm
- optimization algorithm
- segmentation algorithm
- recognition algorithm
- particle swarm optimization
- search algorithm
- approximation ratio
- objective function
- optimal solution
- approximation algorithms
- space complexity
- worst case
- computationally efficient
- expectation maximization
- special case
- image segmentation