搜索资源列表
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
Gomory
- 求解整数规划的问题可以解决一般的整数规划模型的解而且效率比较高！在matlab下调试通过-Solving integer programming problems can be solved in the general solution of integer programming model and more efficient! Adopted under the debugger in matlab
stone
- 使用典型的动态规划的思想解石子问题，不过没有添加注释-The use of a typical dynamic programming solution of pebbles thinking problems, but did not add a comment
dtgh_basic_2
- 动态规划典型题型的加强版，本题有一点难度，如果弄懂对动态规划的概念肯定提升很大！-Typical Questions in strengthening the dynamic programming version, the title a bit difficult, if the hang of the concept of dynamic planning certainly enhance the great!
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.
genetic-algorithmfunction-algorithm
- 遗传算法和非线性规划的函数寻优算法matlab实现-A function of the genetic algorithm and nonlinear programming optimization algorithm matlab achieve
HDOJ-1080--LCS
- HDOJ 1080 动态规划题目。欢迎各种讨论交流。-The dynamic programming topics HDOJ 1080. Welcome discussions AC.
1264.-Atomic-Car-Race
- sicily 1264，动态规划，计算最佳换轮胎方案，输出最短时间-Sicily 1264, dynamic programming, to calculate the best to change a tire program, the output shortest time
Demo
- 人生系统 很简单的 往采纳 简单人生规划-Demo rensheng
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.
A-path-planning
- A*路径规划源代码，一种利用A*搜索路径的方法-A* path planning
CatalanCalculater
- 两种卡特兰斯计算模板，含测试用例！采用动态规划打表的方式进行实现！-Catalan Numbers Calculater
TSP
- 描述 Traveling Salesman Problem 市场上有很多种商品，旅行商Shrek做短期买卖赚取差价。他从一个城市购买一件商品，到达下一个相邻的城市就卖掉。如果这一次买卖无利可图，那么他就不会这么走。凭着自己和同伴多年的经验，他已经对地图上n个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价，此时Shrek只好倒卖利润最大的一件商品。 现在请你帮Shrek规划一条路线，使他能赚最多的钱。 输入 第一行两个整数n、m。表示
GraphCPro
- 景区管理系统，可查询景区信息，可生成景区路径规划图-Scene Manage
Astar-example-1
- A*是一种基本的路径规划算法，本程序提供了A*的一个例子，初学者可以通过代码学习A*的原理。-A* is a basic path planning algorithm, this program provides an example of A*, beginners can learn the principle of A*.
王敬贤-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)