Description: 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least. Platform: |
Size: 1024 |
Author:韩希先 |
Hits:
Description: 这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures for calculating the minimum cost path, with similar ideas can solve the optimal distribution program! Platform: |
Size: 5120 |
Author:中国 |
Hits:
Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable. Platform: |
Size: 3072 |
Author:唐海浪 |
Hits:
Description: 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs Platform: |
Size: 2048 |
Author: |
Hits:
Description: 本文通过研究动态规划原理，提出了根据该原理解决０／１背包问题的方法与算法实现，并对算法的正确性作了验证．观察程序运行结果，发现基于动态规划的算法能够得到正确的决策方案且比穷举法有效．-through research paper on dynamic programming, According to the principle of resolving the 0/1 knapsack problem with the algorithm, the algorithm was verified the correctness. Observation running findings, based on dynamic programming algorithm can be the correct decision than a program exhaustive method effective. Platform: |
Size: 10240 |
Author:汤烈 |
Hits:
Description: 多阶段决策过程（ multistep decision process ）是指 这样一类特殊的活动过程，过程可以按时间顺序分解成若干个相互联系的阶段，在每一个阶段都需要做出决策，全部过程的决策是一个决策序列。 动态规划 （ dynamic programming ）算法 是解决 多阶段决策过程最优化问题 的一种常用方法，难度比较大，技巧性也很强。利用动态规划算法，可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。动态规划算法的基本思想是：将待求解的问题分解成若干个相互联系的子问题，先求解子问题，然后从这些子问题的解得到原问题的解； 对于重复出现的子问题，只在第一次遇到的时候对它进行求解，并把答案保存起来，让以后再次遇到时直接引用答案，不必重新求解 。动态规划算法将问题的解决方案视为一系列决策的结果，与贪婪算法不同的是，在贪婪算法中，每采用一次贪婪准则，便做出一个不可撤回的决策；而在动态规划算法中，还要考察每个最优决策序列中是否包含一个最优决策子序列，即问题是否具有最优子结构性质。
-multi-stage decision-making process (multistep decision process) is that like a special kind of process, the process can be time-sequence decomposed into a number of interrelated stage, in every stage of a need to make a decision, all of the decision-making process is a sequence of decision-making. Dynamic Programming (dynamic programming) algorithm is a multi-stage decision-making process optimization asked that's a common method was more difficult, skills also have a strong character. Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem. Dynamic programming algorithm is the basic idea : to be solving the problem is decomposed into a number of interrelated issues son, Solving the problem first s Platform: |
Size: 3072 |
Author:汤烈 |
Hits:
Description: 基于动态规划的中文分词程序，用vc写的，便于扩展。-based on dynamic programming of the Chinese word segmentation procedures using vc write, easy expansion. Platform: |
Size: 59392 |
Author:何伟 |
Hits:
Description: 动态规划的基本思想和基本步骤，通过实例研究了利用动态规划设计算法的具体途径，讨论了动态规划的一些实现技巧，并将动态规划和其他一些算法作了比较-dynamic programming the basic ideology and the basic steps examples of the use of dynamic programming algorithm design specific ways to discuss the dynamic programming to achieve some skills, and dynamic planning and some other algorithm are compared Platform: |
Size: 27648 |
Author:曹力 |
Hits:
Description: 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared Platform: |
Size: 1024 |
Author:xieyixin |
Hits:
Description: 介绍动态规划算法方面的论文:
动态规划的深入探讨/基本动态规划问题的扩展-Introduction of dynamic programming algorithm for papers: Dynamic Programming-depth study/basic dynamic programming problem of the expansion of Platform: |
Size: 470016 |
Author:zzflash |
Hits:
Description: 运用动态规划原理实现水库优化调度，即调度期内个时期水库水位的控制，从而达到效益最大化。-The use of dynamic programming to achieve optimal operation of reservoirs, the reservoir water level periods during scheduling of control, so as to achieve maximum benefit. Platform: |
Size: 1616896 |
Author:徐佳 |
Hits:
Description: 设平面上有一个m×n 的网格，将左下角的网格点标记为（0,0）而右上角的网格点标记为（m,n）。某人想从（0,0）出发沿网格线行进到达（m,n），但是在网格点（i,j）处他只能向上行进或者向右行进，向上行进的代价为aij（amj ＝＋∞），向右行进的代价是bij（bin ＝＋∞）。试设计一个动态规划算法，在这个网格中为该旅行者寻找一条代价最小的旅行路线。(There is a m * n mesh on the plane, and the grid point on the lower left is marked (0,0), and the grid point on the upper right is marked as (m, n). Want sb (0,0) starting from marching along the mesh line at (m, n), but in the grid point (I, J) where he can only travel up or to travel on the road to the right, the price for AIJ (AMJ = 2), the road to the right is the price of bij (bin = 2). A dynamic programming algorithm is designed to find the least cost travel route for the traveler in this grid.) Platform: |
Size: 4096 |
Author:16物联网
|
Hits:
Search - dynamic programming