A new algorithm design technique for hard problems.
András FaragóRupei XuPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- hard problems
- cost function
- dynamic programming
- computational complexity
- optimal solution
- significant improvement
- similarity measure
- learning algorithm
- probabilistic model
- expectation maximization
- detection algorithm
- user interface
- search strategy
- greedy algorithm
- decision trees
- objective function
- hardware implementation
- solution quality
- convergence rate
- segmentation algorithm
- upper bound
- multi objective
- preprocessing
- reinforcement learning