搜索资源列表
jlpdongtaiguihua
- 动态规划的java描述，ppt格式的，欢迎分享-Dynamic Programming java described ppt format, and welcome to share
Project3finishOK
- 动态规划实现的字典排序，构建最优二叉树，小心你的内存啊！-Dynamic Programming dictionary order to construct the optimal binary tree, carefully your memory ah!
huolangdan
- 问题：货郎担问题 实现方法：枚举，回溯，动态规划，分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
DynamicKnap
- 动态规划背包问题，对算法初学者有极大的参考价值！-dynamic programming knapsack problem, the algorithm beginners have great reference value!
knn-dwt
- matlab环境下基于动态规划算法的语音识别系统！-Matlab environment based on dynamic programming algorithm Speech Recognition System!
dtgh
- 和贪婪算法一样，在动态规划中，可将一个问题的解决方案视为一系列决策的结果。不同的是，在贪婪算法中，每采用一次贪婪准则便做出一个不可撤回的决策，而在动态规划中，还要考察每个最优决策序列中是否包含一个最优子序列。-and the greedy algorithm, the dynamic programming, can be a solution to the problem as the result of a series of policy decisions. The difference
banshuji-dynamicstate
- 半数集问题--动态规划算法,也是算法分析与设计的其中算法分析,用于数集问题.-half set of issues -- dynamic programming algorithm, as well as algorithm analysis and design of the algorithm analysis, Set for a few problems.
LISS_FAST
- 时间复杂度为O(nlogn)的最长单调递增子序列问题的计算程序。不是动态规划算法。在一分钟之内可以计算n=10^6个元素的递增子序列。-time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements
mySuanfa
- 里面包含vc的经典算法,如动态规划,分治,回溯,贪心算法等-contained vc classic algorithms, such as dynamic planning, administration, backtracking, greedy algorithm
changyong
- 动态规划分治算法概率算法模拟退火算法神经网络搜索算法贪婪算法网上matlab遗传算法组合算法Floyd算法-dynamic programming algorithm partition probability algorithm simulated annealing neural network algorithm for the greedy algorithm search online matl ab genetic algorithm combination algorithm Fl
01BEIBAOdongtai
- 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
PebbleMerging
- 石子合并问题的解法，一道动态规划的经典问题，题目也已打包上传-cobble solution of the merger, one of the classic dynamic programming problem, the title has been wrapped up and upload
shuxuejianmojiaocheng
- 第一章 线性规划 第二章 整数规划 第三章 非线性规划 第四章 动态规划 第五章 图与网络（一）第六章 图与网络（二） 第七章初等数学方法建模 第八章 层次分析法 第九章 差分方法-first chapter linear programming second chapter integer programming Nonlinear Programming third chapter IV of chapter V dynamic programming with the network ma
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
yixiesuangfa
- 动态规划＋备忘录法 求最佳矩阵连乘,觉得不错，可以看下．-+ memorandum dynamic programming method for the best matrix continually multiply, and think it's good, can see next.
SilverCoin
- 动态规划解银币问题(C++实现)-dynamic programming solution Coin (C achieved)
LCS
- 动态规划解决LCS-dynamic programming solution LCS
dynamic_programming_about_travel
- 动态规划算法解决行商问题 VC-dynamic programming algorithm to solve the problem VC Cohong
benchmark+for+DP
- 旅行商问题动态规划算法的应用 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 -TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected
beibao
- 0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。