An optimal deterministic algorithm for online b-matching.
Bala KalyanasundaramKirk PruhsPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- dynamic programming
- optimal solution
- experimental evaluation
- worst case
- objective function
- preprocessing
- optimization algorithm
- matching algorithm
- k means
- expectation maximization
- string matching
- matching process
- detection algorithm
- high accuracy
- learning algorithm
- locally optimal
- optimal parameters
- globally optimal
- particle swarm optimization
- cost function
- search space
- decision trees
- image matching
- exhaustive search
- times faster
- randomized algorithms
- genetic algorithm
- convergence rate
- path planning
- simulated annealing
- markov random field
- upper bound
- np hard
- reinforcement learning