搜索资源列表
-
0下载：
用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
-
-
0下载：
用动态规划实现矩阵链乘的java代码-Dynamic Programming Matrix chain by the java code.
-
-
0下载：
动态规划问题的讲义，ppt格式，已经压缩-dynamic programming problem handouts, ppt format has been compressed
-
-
1下载：
第一章 线性规划 第二章 整数规划 第三章 非线性规划 第四章 动态规划 第五章 图与网络（一）第六章 图与网络（二） 第七章初等数学方法建模 第八章 层次分析法 第九章 差分方法-first chapter linear programming second chapter integer programming Nonlinear Programming third chapter IV of chapter V dynamic programming with the network ma
-
-
0下载：
动态规划介绍及其应用！-introduced Dynamic Programming and Applications!
-
-
0下载：
动态规划算法的一个应用-dynamic programming algorithm for the application of a
-
-
0下载：
Thesis on dynamic programming.
-
-
0下载：
四柱汉诺塔问题，设计并实现一个求解四塔问题的动态规划算法，并分析时间和空间复杂性-Peg Hanoi Tower problem, design and implement a four tower problem solving dynamic programming algorithm, and analyze time and space complexity
-
-
0下载：
knapsack，用动态规划解背包问题，可直接在eclipse上运行。-knapsack, knapsack problem using dynamic programming solution can be directly run in eclipse.
-
-
0下载：
javascr ipt动态编程教程源码,if switch语句-dynamic programming tutorial javascr ipt source, if switch statement
-
-
0下载：
基于Java web的动态图表编程 包括了jfreechart 里面有好多的例程 都是很基本的 而且可以直接使用的好多接口-Java web-based dynamic programming chart included inside JfreeChart there is a lot of the routines are very basic and can be directly used in a lot of interface
-
-
0下载：
用Java解的北京大学acm的第1088道题目 是个算法密集型的题目 动态规划的-Java Solution by Beijing University acm section 1088 of Title are the subject of intensive algorithm of dynamic programming
-
-
0下载：
经典的背包问题用动态规划实现的JAVA代码-Classical knapsack problem using dynamic programming to achieve the JAVA code
-
-
0下载：
采用了动态规划法即FLOYD算法利用矩阵求多源最短路径的JAVA实现-Using a dynamic programming method that is FLOYD algorithm uses matrix Multi-source shortest path to achieve JAVA
-
-
0下载：
Dynamic programming formulation for variable returns
-
-
0下载：
java实现0/1背包问题，算法中所用到的为动态规划寻找最优解的思想。-java to achieve 0/1 knapsack problem, algorithms are used to find the optimal solution for the dynamic programming ideas.
-
-
0下载：
用动态规划算法，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
-
-
0下载：
用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.
-
-
0下载：
flash编程动感拖尾模糊设计代码Fuzzy dynamic programming flash design code trailing
-Fuzzy dynamic programming flash design code trailing
-
-
0下载：
3D map dynamic programming
-
