搜索资源列表
DP
- 算法设计的经典问题，动态规划算法，实现0-1背包问题-Classic problem of algorithm design, dynamic programming algorithm to achieve the 0-1 knapsack problem
The-dynamic-programming
- 用动态规划算法，JAVA实现：给定n个整数组成的序列，现在要求将序列分割为m段，每段子序列中的数在原序列中连续排序。如何分割才能使这m段子序列的和的最大值达到最小？-Using dynamic programming algorithm, JAVA implementation: the composition of a given sequence of n integers, now requires the sequence is divided into m segments, the
dongtaiguihua
- 用动态规划算法计算旅行商 挺不错的，可以看看 输入的时候是输入矩阵 需要自己换行-Dynamic programming algorithm with very good salesman, you can see when the input is the input matrix needs its own wrap
LCS
- LCS问题具有最优子结构和重叠子问题的性质，因此采用动态规划算法自底向上计算该问题的解，并输出求到的LCS。-LCS problem with sub-optimal substructure and overlapping nature of the problem, so a bottom-up dynamic programming algorithm for computing the solution of the problem, and the output request to
knapsackproblem
- 贪心算法，回溯法，动态规划算法解决0-1背包问题-Greedy algorithms, backtracking, dynamic programming algorithm to solve 0-1 knapsack problem
dynamicprogramming
- 动态规划算法，高教杯数学建模真题列车调度-Dynamic Programming
jianmobaodian
- 在提高训练中我们主要针对时序图分析，现代智能优化算法（遗传算法和蚁群算法），动态规划，排队理论，目标规划，层次分析以及决策论等相关理论做了比较深刻的了解。然后针对具体情况，具体问题进行建模训练，并加以上机实习。-In training, we aimed to improve timing diagram analysis, modern intelligent optimization algorithm (genetic algorithm and ant colony optimizati
paobing
- 效一种率较高的动态规划算法的实现，题目要求已经写在rar中-A kind of high efficiency rate of the dynamic programming algorithm, subject of the request has been written in the rar
dynamic
- 算法，用c++实现动态规划算法的背包问题（在VS2008平台上）-Algorithm, using c++ dynamic programming algorithm for knapsack problem (in VS2008 platform)
assgin02
- 本程序解决下列问题：利用动态规划算法实现装配线调度问题。 要求测试数据以文本文件的形式存储， 即所有的数据由文本文件读入。-This program addresses the following issues: the use of dynamic programming algorithm assembly line scheduling problem. requires test data to a text file is st
Multiplicative-matrix
- 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Multiplicative matrix: matrices with multiplication, the order of the dynamic programming algorithm to solve the problem
somealgorithm
- 描述了分支定界算法，贪婪算法，动态规划算法，分而治之算法，回溯算法，理论性很强-Describe the branch and bound algorithm, greedy algorithms, dynamic programming algorithm, divide and conquer algorithms, backtracking algorithms, highly theoretical
dongtai
- C++的动态规划算法，关于最大字段和的问题-C++, dynamic programming algorithm, the problem on the maximum field and
imgcompress
- 运用C语言使用动态规划算法设计思想实现的图像压缩算法源程序-Using C language using the dynamic programming algorithm design thought realize image compression algorithm source program
dtgh
- 用动态规划算法做的石子归并问题，vc6环境下能够成功运行-Dynamic programming algorithm to do with stones merge problem, vc6 environment can be run successfully
ShortestPath
- 本程序是使用动态规划算法来解决单源最短路径问题。使用时，先输入每个头结点的邻接顶点个数，然后输入每个邻接顶点的数据。-This procedure is to use the dynamic programming algorithm to solve the single-source shortest path problem. When used, enter each of the first number of vertices adjacent node, and then ente
Algorithmdesign
- 递归与分治算法的设计 动态规划算法设计 贪心算法设计 -Recursive divide and conquer algorithm with dynamic programming algorithm designed greedy algorithm
LCS
- 利用动态规划算法寻找两个list中的最长公共子序列，并分别记录了最长公共子序列的在list中的结束位置-Dynamic programming algorithm to find the two list the longest common subsequence, and recorded the longest common subsequence of the end position in the list
treasure
- 寻宝问题 动态规划算法 原理同0/1背包问题-Treasure Hunt with the principles of dynamic programming algorithm problems 0/1 knapsack problem
Dynamic-programming
- 动态规划算法的相关文档。动态规划算法可用于很多方面，比如立体匹配等。-Dynamic programming algorithm documentation. Dynamic programming algorithm can be used in many aspects, such as stereo matching.