Avoiding spurious submovement decompositions: a globally optimal algorithm.
Brandon RohrerNeville HoganPublished in: Biol. Cybern. (2003)
Keyphrases
- globally optimal
- locally optimal
- simulated annealing
- computational complexity
- optimization algorithm
- global optimality
- learning algorithm
- matching algorithm
- probabilistic model
- dynamic programming
- cost function
- preprocessing
- graph cuts
- computational cost
- convergence rate
- semidefinite programming
- search space
- linear programming
- expectation maximization
- segmentation algorithm
- knapsack problem
- combinatorial optimization problems