搜索资源列表
RSV_DDDP.rar
- 增量动态规划求解水库调度的程序，觉得还挺实用,Incremental dynamic programming for solving reservoir operation procedures
Discrete optimization
- 它包含了枚举法、蒙特卡洛法、线性整数规划、整数规划枚举法、整数规划隐枚举法、非线性整数规划、非线性整数规划图形工具、最小生成树kruskal算法、最短路dijkstra算法、最小生成树kruskal算法mex程序、最短路dijkstra算法mex程序和动态规划的代码。-It contains the matlab code of the enumeration method, Monte Carlo method, linear integer programming, integer prog
shortestPath
- 在visual C++上写的动态规划算法在图论中旅行商问题上的应用，适合算法分析的朋友。-In visual C++ to write the dynamic programming algorithm to find the shortest path in the graph the application of suitable algorithms friends.
dynamic
- 关于动态规划的poj的一些解题报告和代码-On dynamic programming POJ report some problem-solving and code
dongtaiguihua
- 含有说明文档，详细介绍了动态规划算法的实现，并有几个例子-Contains documentation, detailing the dynamic programming algorithm, as well as a few examples
DP
- 动态规划算法，已通过调试，里面包含了两个测试文件-Dynamic programming algorithm, has passed testing, which includes two test file
dynamicprogramming
- 算法分析中的实例，利用递归的思想解决动态规划问题-Examples of algorithm analysis, recursive thinking to solve the problem of dynamic programming
MinForeDynprog
- 该程序实现了一个标准的动态规划算法，对研究动态规划很有帮助。-It is a code to study DP.
knapsack
- 0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
adhdpmain_w85
- 自适应动态规划(ADHDP)程序 模型为3-65-1,net412000.mat-ADHDP
lcs_vb
- 用动态规划算法思想求最小编辑距离VB实现-distanse
Dynamic
- 吉林大学时小虎老师机器学习课件——介绍动态规划-Jilin University, when the Tigers a teacher machine learning courseware- Introduction Dynamic Programming
matrix_mult
- 关于矩阵连乘的问题，用动态规划的算法思想进行的实现！-matrix_mult
动态规划合集
- 与动态规划问题相关的内容讲解，包括背包问题等等(Related to dynamic programming issues, including knapsack problems and so on)
D_spsstereo
- 利用动态规划和互信息计算初始视差图，在此基础上对初始视差图进行左右一致性检验等进行求精(The initial disparity is computed according to dynamic programming and Mutual Information. Furthermore, the consistency examination is utilized for disparity refinement)
动态规划
- -动态规划(Dynamic Programming,简称DP),虽然抽象后进行求解的思路并不复杂,但具体的形式千差万别,找出问题的子结构以及通过子结构重新构造最优解的过程很难统一,(Dynamic programming (Dynamic Programming, referred to as DP), although the abstract is solved after thinking is not complicated, but the specific form of diffe
动态规划
- 背包问题的动态规划程序，只是简单实现，有什么问题可以和我交流讨论。(Knapsack problem dynamic planning process, just a simple realization, what issues can be discussed with me.)
动态规划
- 动态规划问题1234567890111223(Dynamic programming problem1234567890111223)
动态规划求解0-1背包问题
- 通过动态规划的算法得到装进背包的最大价值(The maximum value of knapsack is obtained by dynamic programming algorithm.)
leader-following 自适应动态规划仿真
- 本代码运用自适应动态规划理论，结合BP神经网络，设计实现多智能体系统的一致控制。其中的控制率是由HDP框架的BP神经网络基于智能体的实时状态数据自适应产生的。(leader-following consensus by adaptive dynamic programming)