搜索资源列表
bagprogram
- 用动态规划来解0-1背包问题的算法思想及程序代码-use dynamic programming solution to the 0-1 knapsack problem algorithms and code thinking
03113111
- 动态规划 矩阵连乘问题 算法设计与分析 练习题 -dynamic programming matrix continually multiply problems algorithm design and analysis Exercises
maoren
- 矩阵乘法动态规划 矩阵乘法动态规划-matrix multiplication dynamic programming matri x multiplication Dynamic Programming
BestBST
- 该源程序是用动态规划算法求解最优二叉搜索树问题-the source is dynamic programming algorithm for optimal binary search tree problem
01beibao
- 0-1背包问题,用动态规划算法来实现的.-0-1 knapsack problem with dynamic programming algorithm to achieve.
0-1Pack
- 用C#写的《计算机软件算法分析与设计》的作业--动态规划算法，0-1背包问题 可选择背包容量（浮点型）和指定每个物品的重量（浮点型），生成物品选择表和统计信息
TSP
- 这是一个货郎担问题的动态规划代码,是C语言版的,能在TC上和VC++6.0上运行.加入了许多注释.
Knapsack
- 背包问题,一个不错的动态规划算法显示,值得一看-Knapsack problem, a good dynamic programming algorithm indicates that worth a visit
EditDistance
- C#的计算编辑距离的代码。可指定需要计算的区间以及操作代价函数。算法用动态规划方法实现。-C# Edit distance calculation code. Calculation required to specify the range and operating cost function. Algorithm using dynamic programming method.
dongtaiguihua
- 用动态规划实现最短路径问题 请大家指教-Achieve the shortest path dynamic programming problem
dongtaiguihua
- 算法设计课程设计中的动态规划算法的c++代码实现-Algorithm design in the curriculum design of the dynamic programming algorithm c++ code to achieve
LMIS
- 动态规划求解最长单调递增子序列，给出了图形界面-Dynamic programming to solve the longest monotonically increasing subsequence given the graphical user interface
LDCshape
- 用动态规划算法思想求最小编辑距离用C#实现-distanse
Painting_A_Board
- 画板涂色问题，动态规划的方法，求最好的涂色办法，-Sketchpad coloring problem, dynamic programming method, for the best coloring methods
CURRENCY
- 利用动态规划和webservice，得到当前币种（新加坡，澳元，美元，英镑，人民币）之间的汇率，寻找最优换汇路径。-get currency of several money, search the best changing path by dynamic programming.
plo
- c++动态规划问题之多边形游戏，输出游戏的可能最大值，很不错的资源-problem of polygon c++ dynamic programming game, the game possible maximum output, very good resource
water-cPP
- 用动态规划规划法解决水库调度问题，c语言编程，可以运行，有参考意义-Solve reservoir operation problem using dynamic programming planning method, c programming language, you can run, reference
Activity-selection-problem
- 活动选择问题，递归算法和动态规划，实现在一定的时间里最合理的活动安排，供算法学习用-Activities selection problem, recursive algorithms and dynamic programming to achieve the most rational activities arrange in a certain time, for the algorithm to learn
main
- 算法课程序--动态规划的实现，程序可以运行通过-algorithm program
水库调度POA
- 水库调度POA算法，动态规划的改进方法。(POA algorithm for reservoir scheduling)