Sorting Can Exponentially Speed Up Pure Dynamic Programming.
Stasys JuknaHannes SeiwertPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- dynamic programming
- greedy algorithm
- stereo matching
- state space
- dp matching
- coarse to fine
- markov decision processes
- piecewise linear
- lagrangian relaxation
- grow exponentially
- medical images
- evolutionary algorithm
- preprocessing
- multiscale
- single machine
- genetic algorithm
- infinite horizon
- dynamic programming algorithms
- database