A Reach and Bound algorithm for acyclic dynamic-programming networks.
Matthew D. BaileyRobert L. SmithJeffrey M. AldenPublished in: Networks (2008)
Keyphrases
- dynamic programming
- times faster
- improved algorithm
- worst case
- learning algorithm
- cost function
- preprocessing
- detection algorithm
- recognition algorithm
- probabilistic model
- computational cost
- np hard
- optimal solution
- experimental evaluation
- significant improvement
- locally optimal
- high accuracy
- particle swarm optimization
- expectation maximization
- stereo matching
- space complexity
- neural network
- convergence rate
- dynamic programming algorithms
- error bounds
- functional dependencies
- similarity measure
- complex networks
- tree structure
- segmentation algorithm
- objective function
- scheduling problem
- k means
- relational databases
- lower bound