搜索资源列表
the-dynamic-programming
- 利用matlab实现的动态规划源码 包含了动态规划论文和仿真实例-Use matlab to achieve the dynamic programming source code
poj 1050 动态规划 最大子矩阵
- poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵 poj 1050 动态规划 最大子矩阵
代码及文章
- 自适应动态规划,数据驱动模型,神经网络,最优跟踪控制,鲁棒控制 Data-Driven Robust Approximate Optimal Tracking Control for Unknown General Nonlinear Systems Using Adaptive Dynamic Programming Method(Adaptive dynamic programming, data-driven model, neural networks, optimal trackin
11
- 用动态规划实现邻接矩阵,显示最后的决策和最小的代价(Display final decision and minimum cost)
DProgram
- 最优化算法中的动态规划求解方法,可用于最短路径求解(The dynamic programming solution method can be used to solve the shortest path)
ADP
- 自适应动态规划,利用BP神经网络,进行迭代更新,得到最优值(Adaptive dynamic programming using BP neural network)
D_spsstereo
- 利用动态规划和互信息计算初始视差图,在此基础上对初始视差图进行左右一致性检验等进行求精(The initial disparity is computed according to dynamic programming and Mutual Information. Furthermore, the consistency examination is utilized for disparity refinement)
王敬贤-SA16168143-第3次作业
- 关于两个字符串s1,s2的差别,可以通过计算他们的最小编辑距离来决定。用C++设计动态规划算法解决此类问题(The difference between the two strings s1, s2, can be determined by calculating their minimum edit distance.Using c + + design dynamic programming algorithm to solve these problems)
导弹作战行动网络流模型及动态规划算法_宋志华
- 导弹实施波次打击任务时,需要安排一个较优的运输方案,把多枚导弹在规定的时间内运往各个发射阵地。导弹运输时会涉及道路冲突性、隐蔽性、任务时间限制、道路容量限制等多方面因素,进行运输规划是一个组合优化问题。通过建立运输规划方案的优化模型,可以为常规导弹制定波次作战行动(When a missile strikes a wave, a better transport scheme should be arranged, and multiple missiles will be sent to th
动态规划
- 背包问题的动态规划程序,只是简单实现,有什么问题可以和我交流讨论。(Knapsack problem dynamic planning process, just a simple realization, what issues can be discussed with me.)
动态规划
- 动态规划问题1234567890111223(Dynamic programming problem1234567890111223)
ggg
- 动态规划最短路问题,阶段变量状态变量,决策变量,状态转移,策略,历程,目标函数(dynamic program shortcut problem)
动态规划
- 动态规划的详细说明,比较简单易懂,哈哈哈哈哈(Dynamic programming is described in detail)
第3章 动态规划
- 如果能够保存已解决的子问题的答案,而在需要时再找出已求得的答案,就可以避免大量重复计算,从而得到多项式时间算法。(The polynomial time algorithm can be avoided if the answer of the solved sub problem can be saved and the obtained answer is found when needed.)
矩阵连乘
- 以几个矩阵为例,使用C++实现矩阵连乘动态规划(With a few matrix as an example, the use of C++ to achieve the matrix with dynamic programming)
IEEE Xtreme10.0 painter's dilemma解答
- 这是IEEE Xtreme 10.0。其中的 painter's dilemma这道题,是一道动态规划的题目。这是用C++写的源代码。
背包问题动态规划详解
- 0/1背包问题动态规划详解及C代码 动态规划是用空间换时间的一种方法的抽象。(0/1 knapsack problem dynamic programming detailed and C code Dynamic programming is the abstraction of a method of replacing time with space.)
Matlab(wireless_charging_ADP)
- 基于自适应动态规划的执行依赖启发式动态规划仿真程序,包括评价模块、执行模块、图像输出等(Implementation based on adaptive dynamic programming relies on heuristic dynamic programming simulation program, including evaluation module, execution module, image output, etc.)
Dynamic Programming and Reinforcement Learning
- 动态规划强化学习的课程作业,有详细的问题描述,问题分析,以及具体源代码(The One-Site Tree Cutting Problem By Dynamic Programming and Reinforcement Learning)
字符串编辑
- 两个字符串,A和B,从A变成B,可以通过增加、删除、修改字母来实现,其中每增加、删除、修改一个字母为一步,此程序可以通过动态规划的方法计算出字符串编辑的最少步骤数(Two strings, A and B, from A to B, can be achieved by adding, deletion and modification of letters, each of which increase, delete and modify a letter into one step, th