搜索资源列表
dongtaiguihua
- 实现动态规划,这里是一下关于动态规划的例子。这是一个word文档，里面有源代码-some example
1D1Ddongtaiguihua
- 动态规划 优化 dongtaiguihua-Optimization of the dongtaiguihua
dongtaiguihua
- 通过使用C++代码编写实现动态规划背包的最优解问题。-By using the C++ coding to achieve the optimal solution of dynamic programming knapsack problem.
dongtaiguihua
- 算法分析与设计例子：可以完整运行+详细说明：若给定n个整数组成的序列a1，a2，a3，……an，求该序列形如ai＋ai＋1＋……＋an的最大值。-Examples of Algorithm Analysis and Design: You can run+ full details: If a given sequence of n integers a1, a2, a3, ... ... an, find the sequence of the form ai+ ai+1+ ... ...+
dongtaiguihua
- 动态规划的基本思想是把求解的问题分成许多阶段或 多个子问题，然后按照顺序求解各个子问题。前一子问题的解为后一子问题的求解提供了有用的信息。在求解任一子问题时，列出各种可能的局部解，通过决策保留那些可能达到最优的局部解，舍弃其他的局部解。依次解决各个子问题，最后一个子问题的解就是原问题的解。动态规划算法与分治法类似，但是不同的是，在使用动态规划求解问题时得到的各个子问题往往不是相互独立的。由于动态规划算法解决问题往往有重叠子问题的特点，因此为了减少重复计算，不管该子问题以后是否被用到，只要它被
dongtaiguihua
- 有N项食物营养价值为Vi,价格为Pi,i=1,2,...n.套餐中每项食物至多出现一次，客人通常需要一个算法求解不超过总价值的营养价值最大的套餐-Nutritional value of food items has N as Vi, the price for the Pi, i = 1,2, ... n. packages at most once in each of the food, the guests usually no more than an algorithm for th
01beibao(dongtaiguihua)
- 01背包问题的动态规划算法，能运行，我调好的-01 knapsack problem dynamic programming algorithm, to run, I am a good tune
dongtaiguihua
- 对一个公交最佳运营路线的优化处理 采用动态规划法 vc++编程-Optimal operation of a bus route optimization using dynamic programming vc++ programming
dongtaiguihua
- 算法中有关动态规划问题的源码，算法简介，运行效率高，时间和空间复杂性都很小-Dynamic programming algorithm for the problem of source code, algorithm profile, high efficiency, time and space complexity are very small
dongtaiguihua
- 非常典型的几道动态规划题目，很适合入门。-Very typical dynamic programming subject, it is suitable for beginners.
dongtaiguihua
- 关于动态规划的原代码，可以用于学习动态规划算法-Dynamic programming source code, can be used to study the dynamic programming algorithm
dongtaiguihua
- java实现的动态规划算法，从指定文件中获取图，判断是否存在最短路径并求出其最短路径-java implementation of the dynamic programming algorithm to obtain the diagram from the specified file to determine whether there is a shortest path and calculate the shortest path
dongtaiguihua-xianlufengpei
- 本word中运用动态规划思想运用matlab编程解决实际的线路分配问题的例子-Dynamic programming using matlab programming examples of actual line allocation problem in the use of the word
dongtaiguihua
- 利用动态规划，求最长子序列问题 两个序列数据可读文本文件输入也可通过键盘输入且显示结果。 -The use of dynamic programming, find the longest subsequence problem of two sequence data readable text file input via keyboard input and display the results.
DONGTAIGUIHUA
- matlab中运用动态规划算法在水利水电中的应用-Using the dynamic programming algorithm in the matlab application in water conservancy and hydropower
dongtaiguihua
- 动态规划法所有算法，测试多段图最短路径程序代码，测试Floyd算法程序等-All dynamic programming algorithm to test multi-stage shortest path map program code, test procedures Floyd algorithm
dongtaiguihua
- 基于matlab软件对采集到的两幅图像进行关于动态规划方法的编程-Matlab software based on collected two images on programming dynamic programming method
dongtaiguihua
- 动态规划 运筹学必备，包含资料，说明论文-Dynamic programming operations research necessary, contain information on papers
dongtaiguihua
- 数学建模中的动态规划算法matlab实例，做数学建模的同学可以参考-Mathematical modeling of the dynamic programming algorithm matlab instance, do mathematical modeling students can refer to
dongtaiguihua
- 基于MATLAB语言，采用动态规划方法求解最短路径问题-Based on MATLAB language, using dynamic programming method for solving the shortest path problem