搜索资源列表
xinchengxu
- 包括GRAY码,工作分配问题,会场安排,石子,行数字三角形,最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorith
thesis2000_fangqi
- 算法分析和设计的主要原理,动态规划 贪心算法 背包问题的实例-algorithm analysis and design of the main principle of dynamic programming greedy algorithm examples knapsack problem
BinPacking
- 这是最难的一个程序了,算法是运筹学里的branch band的集装箱问题的最优动态规划解法,当年我的头都大了才实现的,绝得数学加实践的程序-this is the most difficult of a process, the algorithm is tacticians band's branch of the container optimal dynamic programming solution, for the
背包算法
- 高级算法中的背包问题求解,算法简便高效,主要解决动态规划0-1背包问题-senior algorithm to solve the knapsack problem, the algorithm is simple and efficient, dynamic programming solution 0-1 knapsack problem
贪婪算法-单源最短路径
- 贪婪算法最短路径实现。单源最短路径-greed to achieve the shortest path algorithm. Single-source shortest path. .
20060410
- 动态时间规整(DTW)算法基于动态规划的思想,解决了说话人不同时期发音长短、语速不一样的匹配问题。-dynamic time warping (DTW) algorithm is based on dynamic programming ideas, Speaker solve the different pronunciation of the length of time, Ma'am not match the same
subsetcalculator
- 本算法实现2-10集合划分问题,采用动态规划法和大整数方法-the algorithm 2-10 set partition, using dynamic programming methods and the Integer
tianji
- 田忌赛马问题:用动态规划问题,解决最优化问题,不错的算法哦-Tianji race issue : dynamic programming problem solving optimization problems, a good algorithm oh.
mathmodel
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法:模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法)-This a good model to
Beautifulprint
- 该程序用Java实现了算法中的动态规划问题_漂亮打印-the program using Java to achieve a dynamic algorithm planning _ pretty Print
aglorithm
- 问题算法源代码:骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest short
LongestCommonSequenceLENGTH
- 该程序为算法分析中的一个经典问题,可以通过此程序,用动态规划的算法找出两个字符序列的最长公共子序列-procedures for the analysis of algorithms a classic problem, through this procedure, use dynamic programming algorithm to find two characters of the longest sequence of p
LongestSeq
- 该程序为算法分析中的一个经典问题,可以通过此程序,用动态规划的算法找出一个符序列的最长的升序子序列的并且实现了算法的最低耗费-procedures for the analysis of algorithms a classic problem, through this procedure, use dynamic programming algorithm to find a website of the longest seque
596dongtaiguihua
- 动态规划的基本思想和基本步骤,通过实例研究了利用动态规划设计算法的具体途径,讨论了动态规划的一些实现技巧,并将动态规划和其他一些算法作了比较-dynamic programming the basic ideology and the basic steps examples of the use of dynamic programming algorithm design specific ways to discuss the d
DynamicKnap
- 动态规划背包问题,对算法初学者有极大的参考价值!-dynamic programming knapsack problem, the algorithm beginners have great reference value!
mySuanfa
- 里面包含vc的经典算法,如动态规划,分治,回溯,贪心算法等-contained vc classic algorithms, such as dynamic planning, administration, backtracking, greedy algorithm
OI
- 用多种算法解决0-1背包问题,包括回朔法,动态规划,贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
suanfashejiyufenxi
- 这是计算机常用算法及其分析,算法如动态规划,贪心算法,分治算法,分支定界算法等。-This is a commonly used computer algorithms and analysis, algorithms such as dynamic programming, greedy algorithm, sub-rule algorithm, branch and bound algorithm.
short_path
- 四种算法求最短路径的例子,C#,图形演示 分别为贪心发,动态规划发,分支限界法,和回溯法-Four shortest path algorithm for example, C#, Graphical presentations were greedy fat, fat, dynamic programming, branch and bound method, and backtracking
guihua
- 算法设计分析,动态规划,与背包问题类似的最优化求解问题-Algorithm design and analysis, dynamic programming, knapsack problem with a similar optimization problem solving