搜索资源列表
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.
IDP
- 本系统的开发是为提供室内定位的实验研究平台，可向学生进行操作示范。从实用的角度出发，可以对系统的总体功能进行大致规划。这些功能包括如下方面： 能够实现实时室内定位，并在场景图中显示待定位节点的位置。 能够动态调整发射功率实现室内定位。 能够选择不同的定位算法实现室内定位。-The system was developed to provide indoor positioning platform for experimental research can be made to s
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
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.
LongCommonSubstrng
- 算法问题，求公共最长自序列，采用动态规划求最优解。-LCS Question DP
java2
- 常用的程序总结，主要是动态规划的算法，有斐波拉契，矩阵，背包，和二叉查找树-Summary of frequently used programs, mainly dynamic programming algorithm, Feibolaqi, matrix, backpacks, and a binary search tree
01beibao
- 01背包的完整版，采用动态规划和贪婪算法解决-01 backpack full version, using dynamic programming and greedy algorithm to solve
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