搜索资源列表
Knap12121
- 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
MatrixDynamicMulti
- 用动态规划实现矩阵链乘的java代码-Dynamic Programming Matrix chain by the java code.
BagZeroOne
- java语言实现动态规划求解0-1背包问题。
FourPegsHanoi
- 四柱汉诺塔问题，设计并实现一个求解四塔问题的动态规划算法，并分析时间和空间复杂性-Peg Hanoi Tower problem, design and implement a four tower problem solving dynamic programming algorithm, and analyze time and space complexity
knapsack
- knapsack，用动态规划解背包问题，可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
viterbi
- 用java实现viterbi算法，由动态规划的方法来寻找出现概率最大的隐藏状态序列
newBag
- 动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
1088
- 用Java解的北京大学acm的第1088道题目 是个算法密集型的题目 动态规划的-Java Solution by Beijing University acm section 1088 of Title are the subject of intensive algorithm of dynamic programming
TestKnapsack
- 经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code
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
minimumC
- JAVA实现动态规划找最少硬币数，内有详细注释
yachtP
- JAVA实现动态规划解游艇最少租金问题，内有详细注释。
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
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