搜索资源列表
DP
- 动态规划另一个教程,很不错的。比刚才那个还很好呢的-something worth to be treasure..........
testdtw(zhu)
- function dist = dtw(t,r) n = size(t,1) m = size(r,1) 帧匹配距离矩阵 d = zeros(n,m) for i = 1:n for j = 1:m d(i,j) = sum((t(i,:)-r(j,:)).^2) end 累积距离矩阵 D = ones(n,m) * realmax D(1,1) = d(1
stone
- 动态规划-最小代价子母树源码,主要提供参考。-Dynamic Programming- PIP minimum cost tree source, the main reference.
Dynamic-Programming
- 动态规划相关介绍,入门的朋友可以看看。欢迎大家下载啊-Dynamic programming related presentations, entry-friends can see. Welcome to download ah ~~~~~
main
- 动态规划算法计算网络的最长路线和最短路线-Network dynamic programming algorithm to calculate the shortest route, the longest line and
Algorithm
- 数据结构,算法,包括动态规划、分治策略、回溯法。-Data structures, algorithms, including dynamic programming, divide and conquer, backtracking.
path-planning4
- 用matlab编写的程序用来求解动态规划最短路径问题,该方法能够快速有效的收敛到全局最优解。-Programs written using matlab to solve the dynamic programming shortest path problem, the method can converge quickly and effectively to the global optimal solution.
dyObst
- 使用动态规划算法实现的最优二叉查找树问题,算法基础中的基本算法。使用vc6.0进行编译-Dynamic programming algorithm using the optimal binary search tree problem, the algorithm based on the basic algorithm. Compiled using vc6.0
CompressImage
- 灰度图像的像素值范围在[0,255]之间,如果采用一个像素一个字节的存储方式,势必会造成空间的浪费。如果采用一定的无损压缩算法,可以大大提高减小文件大小,减少存储空间。本程序采用动态规划中图像压缩算法(图像分段合并的思想),设计一个类,实现灰度位图数据的压缩和解压过程-Grayscale pixel values in the range [0,255], if we adopt a pixel one by
dongtaiguihua
- 通过使用C++代码编写实现动态规划背包的最优解问题。-By using the C++ coding to achieve the optimal solution of dynamic programming knapsack problem.
Dynamic
- 求最长公共自序 列,动态规划算法求最长公共自序 列,动态规划算法 -Preface to seek the maximum demand up to the public from the public sequence, dynamic programming algorithm for getting up to the public from the sequence, dynamic programming algorithm
3.1
- 最长公共子序列问题 最长公共子序列(动态规划) 实验数据:input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z,程序运行结束时,将计算结果输出到文件output.txt中。输出文件中包含问题的答案:找不到公共子序列时给出“null” 。 -Longest common subsequence problem LCS (dynamic pr
3_1
- 长公共子序列问题 最长公共子序列(动态规划) 实验数据:input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z,程序运行结束时,将计算结果输出到文件output.txt中。输出文件中包含问题的答案:找不到公共子序列时给出“null” 。 -“null” 。
knapdynamicprogram
- 0-1背包问题的动态规划算法实现。包含1维及2维0-1背包问题。-0-1 knapsack problem dynamic programming algorithm. Contains 1-D and 2-dimensional 0-1 knapsack problem.
01
- 动态规划算法之0-1背包问题算法的实现。-Dynamic programming algorithm of 0-1 knapsack problem algorithm.
workspace
- 用动态规划解决背包问题,采用递归和非递归两种方式实现,递归过程中保留中间结果以减少复杂度-Dynamic Programming Knapsack Problem
knap
- 用动态规划解决背包问题,分别用递归和非递归方式实现-Knapsack problem using dynamic programming solution, respectively, recursive and non-recursive way to achieve
my_D_P_C
- DP 学习资料,适合新手学习. 用C语言实现动态规划以及相关内容-a learning direction for green hands,about the DP in c++
ACM
- ACM,参考资料,课件,算法,最短路,动态规划-ACM, reference materials, courseware, algorithm, shortest path, dynamic programming
0-1beibao
- 0-1背包问题,很经典的一个问题,基于动态规划的经典案例。-0-1 knapsack problem, it is a problem in the classic, classic case based on dynamic programming.