Description: dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 动态规划的特点及其应用.doc | 246784 | 2018-04-29 |
Download