搜索资源列表
-
0下载：
该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
-
-
0下载：
算法中的经典问题：0——1 背包问题
在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem
-
-
0下载：
使用动态规划求多段图的C++源程序，用于满足最优化问题且问题能转换成一个有向图问题的求解，可以直接运行！-The use of dynamic programming for multi-stage plan of C++ source code, designed to meet the optimization problem and the problem can be converted into a directed graph to solve the problem, you ca
-
-
0下载：
一道经典的动态规划题目
浙江大学硕士生入学复试上机题
http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming
http://acm.hdu.edu.cn/showproblem.php?pid=1231
-
-
0下载：
动态规划算法的一些归纳和应用，方便各位学习用，有背包问题，最长公共字串问题，等。-Some of induction dynamic programming algorithm and applications, ease of learning to use, there are knapsack problem, the longest string of public issues, and so on.
-
-
0下载：
算法，用c++实现动态规划算法的背包问题（在VS2008平台上）-Algorithm, using c++ dynamic programming algorithm for knapsack problem (in VS2008 platform)
-
-
0下载：
动态规划算法的相关文档。动态规划算法可用于很多方面，比如立体匹配等。-Dynamic programming algorithm documentation. Dynamic programming algorithm can be used in many aspects, such as stereo matching.
-
-
0下载：
动态规划法解决经典背包问题，C语言实现。-Classic dynamic programming method to solve the knapsack problem, C language.
-
-
0下载：
动态规划，租用游艇问题，长江游艇俱乐部在长江上设置了n个游艇出租站1，2，…，n。-Dynamic programming, rental boats the problem, the Yangtze River Yacht Club, set in the Yangtze River on a yacht rental station n 1,2, ..., n.
-
-
0下载：
上算法设计课课同学自己准备的讲座，ppt通过举例详细介绍了动态规划的原理，并附有实现源码与测试数据-Division on the algorithm design students prepare their own lectures, ppt described in detail by way of example the principles of dynamic programming, together with source code and test data to achiev
-
-
0下载：
这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsac
-
-
0下载：
关于动态规划算法分析，内含各种相关的问题解析。-The analysis of Dynamic Programming
-
-
0下载：
用动态规划算法解决DP背包问题，采用C++编程-Dynamic programming algorithm to solve the DP knapsack problem, using C++ programming
-
-
0下载：
动态规划解石子合并问题。其中石子是环形排列，具体问题详见“问题描述”文件。-Solve the "stones merge problem" by using dynamic programming algorithm.
-
-
0下载：
这是美国麻省理工学院计算机学院的算法课程里面的动态规划的资料。-Dynamic Programming（MIT）
-
-
0下载：
用动态规划法求两个字符串 A="xzyzzyx"和 B =”zxyyzxz“的最长公共子序列-For two strings A dynamic programming method = " xzyzzyx" and B = " zxyyzxz" the longest common subsequence
-
-
0下载：
动态规划的讲义，包含对动态规划算法的基本介绍以及一些经典例子。-Dynamic Programming notes, contains a basic introduction to the dynamic programming algorithm and some classic examples.
-
-
0下载：
动态规划(dynamic programming)是运筹学的一个分支，是求解决策过程(decision process)最优化的数学方法。20世纪50年代初美国数学家R.E.Bellman等人在研究多阶段决策过程(multistep decision process)的优化问题时，提出了著名的最优化原理(principle of optimality)，把多阶段过程转化为一系列单阶段问题，利用各阶段之间的关系，逐个求解，创立了解决这类过程优化问题的新方法——动态规划。-Dynamic progr
-
-
0下载：
动态规划算法，包括最长公共子序列、矩阵链相乘、FLOYD、背包算法等。-Dynamic programming algorithm, including the maxinum common sub sequence, matrix chain multiplication, FLOYD, knapsack algorithm, etc..
-
-
0下载：
动态规划的详细说明，比较简单易懂，哈哈哈哈哈(Dynamic programming is described in detail)
-
« 12
3
4
5
6
7
8
9
10
...
17
»
