搜索资源列表
juzhen3.1
- 动态规划解决矩阵连乘问题 算法设计与分析实验题-With dynamic programming to solve the matrix multiplication problem
viterbi1.0
- 维特比算法，一种动态规划算法，用来求解隐马尔科夫模型-Viterbi algorithm, a dynamic programming algorithm to solve the Hidden Markov Model
optimal_scheduling_independent_tasks
- Visual studio 2005开发环境下 算法课程实验 用动态规划方法解决独立任务最优调度问题-Visual studio 2005 development environment,with a dynamic programming method,in algorithm course experiment, to solve the optimal scheduling independent tasks problem
DP-Navie-LongestCommonSubstring
- 给出了一种基于动态规划的最长公共子串算法（vc），以及一种朴素算法。-There two Longest common substring algorithms writen in VC in this document.One is based on the dynamic programming, the other is naive.
main6
- C语言编写的命令行程序，通过蛮力法、动态规划、分治法求最大字段和，并进行算法效率比较。-C language command-line program, through brute force method, dynamic programming, divide and conquer method for maximum field and, and compare efficiency of the algorithm.
王敬贤-SA16168143-第3次作业
- 关于两个字符串s1,s2的差别，可以通过计算他们的最小编辑距离来决定。用C++设计动态规划算法解决此类问题(The difference between the two strings s1, s2, can be determined by calculating their minimum edit distance.Using c + + design dynamic programming algorithm to solve these problems)