搜索资源列表
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
maxsubsum
- 几种经典算法实现最大字段和问题（分治算法，动态规划算法）
动态规划算法的一个应用
- 动态规划算法的一个应用-dynamic programming algorithm for the application of a
FourPegsHanoi
- 四柱汉诺塔问题，设计并实现一个求解四塔问题的动态规划算法，并分析时间和空间复杂性-Peg Hanoi Tower problem, design and implement a four tower problem solving dynamic programming algorithm, and analyze time and space complexity
viterbi
- 用java实现viterbi算法，由动态规划的方法来寻找出现概率最大的隐藏状态序列
1088
- 用Java解的北京大学acm的第1088道题目 是个算法密集型的题目 动态规划的-Java Solution by Beijing University acm section 1088 of Title are the subject of intensive algorithm of dynamic programming
Knapsack
- java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
lhl.java
- 用JAVA语言 动态规划算法解决0/1背包问题-good
Queen
- JAVA实现，动态规划算法解N皇后问题。
The-dynamic-programming
- 用动态规划算法，JAVA实现：给定n个整数组成的序列，现在要求将序列分割为m段，每段子序列中的数在原序列中连续排序。如何分割才能使这m段子序列的和的最大值达到最小？-Using dynamic programming algorithm, JAVA implementation: the composition of a given sequence of n integers, now requires the sequence is divided into m segments, the
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
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.
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
tuxingyasuo
- 图形压缩的Java脚本文档，采用的是动态规划算法-Java scr ipt compressed graphics files, using a dynamic programming algorithm
DP
- 利用动态规划算法，对水电站厂内机组进行负荷分配，得到机组最优负荷。-The use of dynamic programming algorithm for hydropower plant load distribution unit to obtain the optimal unit load.
DynamicProgramming
- 0/1背包问题是学习动态规划算法最经典的例子 Java代码实现0/1背包问题 代码里有详细的注释，比较好理解-knapsack problem is one of the most classic problems to learn dynamic programming technique Java code,easiser to understand
矩阵连乘问题和租船问题
- 动态规划算法解决矩阵连乘问题和租船问题，java源码。(Dynamic programming algorithm to solve matrix multiplication problem and charter problem, java source code.)