Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm.
Steven J. BramsMichael A. JonesChristian KlamlerPublished in: SIAM Rev. (2011)
Keyphrases
- learning algorithm
- np hard
- times faster
- computational cost
- k means
- single pass
- particle swarm optimization
- linear programming
- experimental evaluation
- dynamic programming
- significant improvement
- computational complexity
- cost function
- selection algorithm
- detection algorithm
- tree structure
- search space
- optimal solution
- similarity measure
- recognition algorithm
- computationally efficient
- matching algorithm
- path planning
- optimization problems
- classification algorithm
- expectation maximization
- preprocessing
- face recognition