搜索资源列表
1D1Ddongtaiguihua
- 动态规划 优化 dongtaiguihua-Optimization of the dongtaiguihua
dongtaiguihua
- 通过使用C++代码编写实现动态规划背包的最优解问题。-By using the C++ coding to achieve the optimal solution of dynamic programming knapsack problem.
dongtaiguihua
- 算法中有关动态规划问题的源码，算法简介，运行效率高，时间和空间复杂性都很小-Dynamic programming algorithm for the problem of source code, algorithm profile, high efficiency, time and space complexity are very small
dongtaiguihua
- 基于matlab软件对采集到的两幅图像进行关于动态规划方法的编程-Matlab software based on collected two images on programming dynamic programming method