搜索资源列表
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
perfect
- 用java 实现的动态规划求漂亮打印问题的一个实例-dynamic programming algorithm an example to solve perfect print problem
The-longest-public-son-sequence
- 最长公共子序列演示程序，算法分析与设计，动态规划算法-The longest public son sequence demo, the algorithm analysis and design, dynamic programming algorithm
src
- 基于动态规划算法，用java实现的自动对联程序-Automatically couplet procedures based on dynamic programming algorithm, implemented in Java
dongtaiguihua
- java实现的动态规划算法，从指定文件中获取图，判断是否存在最短路径并求出其最短路径-java implementation of the dynamic programming algorithm to obtain the diagram from the specified file to determine whether there is a shortest path and calculate the shortest path
CoinsChange
- 硬币找零问题 动态规划算法 JAVA源代码-Coin change for the dynamic programming algorithm for Java source code
suanfa
- 用动态规划实现三角问题，用贪心算法实现装在问题和最短源路径问题-Triangle problems using dynamic programming, greedy algorithms installed in the path of the problem and the shortest source
Viterbi
- 维特比算法，里面涉及到了动态规划，实现找到概率的最大值。-The Viterbi algorithm, which involves dynamic programming to find the maximum value of the probability.
Knapsack2
- 用java实现的01背包问题的动态规划算法，注释很详细，配合《算法导论》的伪代码可以很容易看懂。-01 knapsack problem with java achieve dynamic programming algorithm, very detailed notes, with the " Introduction to Algorithms" pseudo-code can easily understand.
LongCommonSubstrng
- 算法问题，求公共最长自序列，采用动态规划求最优解。-LCS Question DP
Matrixchain
- 矩阵链乘法，采用动态规划，使用java编写。-Matrix-chain Question
java2
- 常用的程序总结，主要是动态规划的算法，有斐波拉契，矩阵，背包，和二叉查找树-Summary of frequently used programs, mainly dynamic programming algorithm, Feibolaqi, matrix, backpacks, and a binary search tree
triangulation
- 动态规划 的非递归实现,实现了三角的划分使得铉长最短！凸显显示-Non-recursive implementation of dynamic programming to achieve a long triangular division makes Hyun shortest! Show highlights
lcs
- 随机生成两个长度为1000的字母序列，利用动态规划算法实现求最长公共子序列，并输出最长公共子序列的长度，一般是320左右。-Two randomly generated sequence of letters of length 1000, the use of dynamic programming algorithm for the longest common subsequence, and the output length of the longest common subseque
01beibao
- 01背包的完整版，采用动态规划和贪婪算法解决-01 backpack full version, using dynamic programming and greedy algorithm to solve
tuxingyasuo
- 图形压缩的Java脚本文档，采用的是动态规划算法-Java scr ipt compressed graphics files, using a dynamic programming algorithm
beibao
- 文件里面的代码主要是用递归算法，动态规划的算法，贪婪算法，回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.
dongtaiguihua
- 通过实例研究了利用动态规划设计算法的具体途径，讨论了动态规划的一些实现技巧，并将动态规划和其他一些算法作了比较，最后还简单介绍了动态规划的数学理论基础-Through case studies of specific ways to use the dynamic planning algorithm, we discussed some implementations of dynamic programming techniques, and compares the dynamic pro
DP
- 利用动态规划算法，对水电站厂内机组进行负荷分配，得到机组最优负荷。-The use of dynamic programming algorithm for hydropower plant load distribution unit to obtain the optimal unit load.