搜索资源列表
背包问题动态规划详解
- 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, et
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 mod
3-7汽车加油
- 该问题采用的是动态规划的思想来解题，用备忘录的方法进行递归,递归的式子后面写出，不能直接以汽车行驶的费用为目标来进行动态规划,因为最优子结构性质得不到证明。所以必须把油量和费用一起考虑,作为动态规划的对象,此时就有了最优子结构性质。(The problem is used in the theory of dynamic programming to solve problems, using recursive method to w
背包
- 给定n种物品和一背包。物品i的重量是wi，体积是bi，其价值为vi，背包的容量为c，容积为d。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或者不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。试设计一个解此问题的动态规划算法，并分析算法的计算复杂性。(Given n items and a knapsack. The weight of the
3-15样本采集
- 设两次行走等长距离，到达（x1，y1）和（x2，y2）处取得的最大价值为h[x1][y1][x2][y2]。容易证明其具有最优子结构性质。动态规划算法如下。(The maximum value of reaching (x1, Y1) and (X2, Y2) at the same length of two times is h[x1][y1][x2][y2]. It is easy to prove that it has the
DP算法Fortran程序
- 动态规划，可用于水库水电站优化调度，求解发电量最大(dynamic programming)
60_30
- 贪心算法求解多维背包问题，动态规划算法近似算法(A greedy algorithm for multidimensional knapsack)
DP
- 有两个小程序，都是动态规划的思想，对于回文字符串的应用，体现了动态规划的特点(There are two programs,which are both the applications of dynamic programming.)
回溯法
- 利用回溯算法和动态规划函数，编写了资源约束下的二维动态规划算法，可用于资源分配方面的问题(Using backtracking algorithm and dynamic programming function, we write a two-dimensional dynamic programming algorithm under resource constraints, which can be used for resou
TestOne
- 阶梯问题的Java源代码，动态规划，蓝桥杯，简单练习(The JAVA source code for the ladder problem)
动态规划
- 动态规划的C++代码，动态规划是应届生笔试面试中的常见题型(Dynamic programming of C++ code, dynamic programming is a common topic in the interview for the students written by the students)
Longest common subsequence
- 用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it wit
Algorithm
- 01背包，批处理作业调度，动态规划，回溯，分支限界(01 knapsack, batch job scheduling, dynamic programming, backtracking, branch and bound.)
动态规划
- 算法初学者学习动态规划的一些简单代码文档(dynamic planning algorithm)
水库调度POA
- 水库调度POA算法，动态规划的改进方法。(POA algorithm for reservoir scheduling)
动态规划的特点及其应用
- 动态算法的讲解，经典例题和相应的源代码，是学习动态规划的好材料(dynamic programming (also known as dynamic optimization) is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subpr
新建文件夹
- 复合电源电动汽车能量管理策略，动力电池—超级电容的复合电源系统的某微型纯电动汽车为研究对象，提出了一种基于随机动态规划的超级电容和动力电池能量分配的优化控制策略。(Energy management strategy of composite power electric vehicle)
3-20有向直线m中值问题(题)
- 用动态规划算法解决有向直线上最小服务转移费用问题(Using dynamic programming algorithm to solve minimum cost of service transfer in directed straight line)