搜索资源列表
Knapsack
- 背包问题,一个不错的动态规划算法显示,值得一看-Knapsack problem, a good dynamic programming algorithm indicates that worth a visit
matlabDynaicProgrammingAlgorithm
- 基于Matlab的动态规划算法的实现,不同的例子主程序一样，不过其他诸如决策函数等是不一样的-Dynamic Programming Algorithm
analysys-and-design-of-algorithm-ppt
- 我上课用的计算机算法设计与分析的电子教案，内容包括了最基本的分治法，贪心法，动态规划法，-I class computer algorithms used in design and analysis of electronic lesson plans, including the most basic sub-rule law, greedy method, dynamic programming method,
AssignTwo
- 求任意长度数据的最长有序子序列的动态规划算法实现！-For arbitrary length of data in an orderly sequence of the longest of the dynamic programming algorithm!
viterbi1.0
- 维特比算法，一种动态规划算法，用来求解隐马尔科夫模型-Viterbi algorithm, a dynamic programming algorithm to solve the Hidden Markov Model
sutawenti
- 动态规划算法的应用 数塔问题 给定一个数塔，其存储形式为如下所示的下三角矩阵。在此数塔中，从顶部出发，在每一节点可以选择向下走还是向右走，一直走到底层。请找出一条路径，使路径上的数值和最大。 输入样例（数塔）： 9 15 10 6 8 2 18 9 5 19 7 10 4 16 输出样例（最大路径和）： 59 -Application of dynamic programming algorithm for a given number of tow
viterbi
- viterbi搜索算法是一种全局动态规划算法,在本例中,我们用C实现了他的搜索过程.-viterbi search algorithm is a global dynamic programming algorithm, in this case, we use C to achieve his search process.
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, greedy, backtracking, branch and b
max_mintree
- 动态规划算法：Max-Min Tree Paritioning-Dynamic Programming Algorithm: Max-Min Tree Paritioning
Fac3_9
- //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm
guihua
- 动态规划算法，java源代码。里面有多段图的算法等，大家一起学习共同进步啊-Dynamic programming algorithm, java source code. Inside how the algorithm above chart we can work together to learn the common progress of ah
TSPTEST
- 动态规划算法求解TSP问题.包含2种求解方式,递归求解和备忘录求解.-Dynamic Programming Algorithm for Solving TSP Problem
strext
- 字符串扩展问题的递归算法及动态规划算法的详细分析及实现-implementation and detailed analysis of recursive algorithm and dynamic programming algorithm of string expansion issue
Matrixchainmultiplication
- 给定n个矩阵构成的一个链<A1,A2,…,An>其中i=1，2，…，n，矩阵Ai的维数为pi-1pi,对乘积A1A2…An以一种最小化标量乘法次数的方式进行加全部括号。该问题应用动态规划算法-N matrix of a given composition of a chain <A1,A2,…,An> Which i = 1,2, ..., n, the dimension of the matrix Ai is pi-1pi, on the product A1A2 .
knapsackproblem
- 自己编写的，背包问题的各种近似算法以及动态规划算法，请多多指教-I have written, knapsack problem, as well as a variety of approximate dynamic programming algorithm algorithm, please advice
ZOJ_CODE
- ZOJ 动态规划算法题目入门与提高 源代码-Dynamic programming algorithm ZOJ subject entry and improve the source code
V2
- 动态规划算法及动态规划的相应说明应用，C++编程-Dynamic programming algorithm and dynamic programming note the application of the corresponding
pack
- 背包问题专项训练 动态规划算法 有题目的C++解法-Knapsack problem dynamic programming algorithm C++ Solution
dianlubuxian
- 用动态规划算法解决电路分布问题-Using dynamic programming algorithm to solve the distribution problem of circuit
dongtaiguihua
- 算法设计课程设计中的动态规划算法的c++代码实现-Algorithm design in the curriculum design of the dynamic programming algorithm c++ code to achieve