搜索资源列表
matlabsuanfa
- 这个程序是基于matlab平台环境下编成的，数学计算方面的算法，包括动态规划算法，拉格朗日插值法，解非线性整数规划法，解线性规划，以及解常微分算法-This procedure is based on matlab platform into the environment, mathematics calculation algorithms, including dynamic programming algorithm, Lagrange interpolation, solution o
package
- 动态规划的背包问题，包括讲解，源代码还有详细的例证。-Dynamic programming knapsack problem, including explanations, there is a detailed source code examples.
BeiBao1
- 动态规划算法求解0-1背包问题,动态规划算法knapsack求最优值-Dynamic programming algorithm for solving 0-1 knapsack problem, dynamic programming algorithm for optimal value knapsack
DP
- 动态规划算法，已通过调试，里面包含了两个测试文件-Dynamic programming algorithm, has passed testing, which includes two test file
1
- 实现动态规划算法和感兴趣区域提取，效果不错啊 -The realization of dynamic programming algorithm and region of interest extraction, the effect of good ah
DTguihua
- 动态规划是对最优化问题的一种新的算法设计方法。由于各种问题的性质不同，确定最优解的条件也互不相同，因而动态规划的没计法对不同的问题，有各具特色的表示方式。-Dynamic programming optimization problem is a new method of algorithm design. The nature of the problem due to various different conditions to determine the optimal solutio
DynamicProgramming
- c实现动态规划，可以求得最小代价，最短路径，基于狄斯奎诺的算法，可直接运行-c
DP
- 详述了算法中动态规划的运用，例举了诸多的例子，算法介绍由浅入深-it introduce the dinamic programming algorithm,it is very useful
dongtaiguihua
- 用动态规划实现最短路径问题 请大家指教-Achieve the shortest path dynamic programming problem
dynamicprogramming
- 算法分析中的实例，利用递归的思想解决动态规划问题-Examples of algorithm analysis, recursive thinking to solve the problem of dynamic programming
DP_pipei
- 用于立体视觉匹配的动态规划（dynamic programming）算法，基于英特尔opencv图像库实现。-Visual match for the three-dimensional dynamic programming (dynamic programming) algorithm, based on the Intel opencv image library.
MinForeDynprog
- 该程序实现了一个标准的动态规划算法，对研究动态规划很有帮助。-It is a code to study DP.
dtw
- DTW的VB实现，利用动态规划的方法实现，经过调试，自己编写的，
DynamicCalculate
- 使用C++语言编写的动态规划--计算最优值。-Dynamic Programming- Calculation of the optimal value
optimization
- 许多生产计划与管理问题都可以归纳为最优化问题, 最优化模型是数学建模中应用最广泛的模型之一,其内容包括线性规划、整数线性规划、非线性规划、动态规划、变分法、最优控制等. -matlab matlab matlab matlab optimization
dynamic
- 动态规划算法 程序设计大赛必备 最优化原理 重复子问题-Dynamic Programming Algorithm Programming Contest necessary to repeat the principle of sub-optimization problem
c41
- 多段图用邻接矩阵存储，编写多段图问题的向后递推动态规划算法。-Multi-stage graph with adjacency matrix storage, the question of the preparation of multi-stage plan backward recursive dynamic programming algorithm.
dynamic
- 本代码为动态规划算法。寻找一条最佳路径，并找出相对应的节点。-The code for the dynamic programming algorithm.
knapsack
- 0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
DP
- 用c++编写的动态规划（DP）源程序。可用于水库调度等优化问题。-Using c++, prepared by Dynamic Programming (DP) source. And so can be used for reservoir operation optimization problem.