搜索资源列表
benchmark+for+DP
- 旅行商问题动态规划算法的应用 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 -TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected
DP
- 用道格拉斯普克算法对线进行化简，处理结果比较好-use DP algorithm with simplified lines
DP
- 动态规划算法，已通过调试，里面包含了两个测试文件-Dynamic programming algorithm, has passed testing, which includes two test file
graytothegrb
- 采用的算法为welsh算法 -di oe uei yo dp
POJsolution090504
- poj 北大oj 90到算法题源码 二分匹配 最大流 简单 dp 搜索 等-poj solution sorcefile
MinForeDynprog
- 该程序实现了一个标准的动态规划算法，对研究动态规划很有帮助。-It is a code to study DP.
poj
- pku 3613 Cow Relays 题意：给一个无向图，求从起点s到终点e尽力n条边的路径最小值。 边的数量2<=t<=100(每条边可以重复遍历) 算法：利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ]) l 表示的是2的指数，假设 i 到 k 要途径 2^l 条边，那么他可以被分为两段 途径2
AlgorithmDesignAnalysis
- 算法难，递归易，算法皆以递归源，相同处理自循环； 递归处理分和并，分而治之是首选。 DP全，贪心简，最优性质二者兼； DP需要表来填，子问题解表中见； 贪心策略需证明，整体可由局部建。 回溯深，分限广，剪枝函数两边忙； 一边剪左不可行，一边剪右非最优。 分限还需优先级，上界下界来排序； 叶子放在队列里，轮到它时达目的。-Algorithm is difficult, recursive easy recursive algorithm begin with the
DP-Navie-LongestCommonSubstring
- 给出了一种基于动态规划的最长公共子串算法（vc），以及一种朴素算法。-There two Longest common substring algorithms writen in VC in this document.One is based on the dynamic programming, the other is naive.
dp
- 这是对dp算法的总结题目，对于想要学习dp算法的人，可以考虑一下一点一点做上面的题目。poj.org-This is a summary of topics dp algorithm, for people who want to learn dp algorithm, you can consider doing a little bit above the title. poj.org
01problem--DP
- 01背包问题,利用动态规划解决一些编程算法问题。-01problem，using DP to deal with this problem and it can help you understand the way to cope with the problems like this.
DP
- 这是道格拉斯算法，使用的是C#语言，描述怎么化简线，程序通俗易懂-This is the Douglas algorithm, using the C# language, describe how simple line, easy to understand
1159-dp
- ACM竞赛时写的最长公共子串算法，效率高，代码可读性好，适合学习-When the ACM contest to write the longest common substring algorithms, high efficiency, good readability of the code, for learning
Nonlinear-DP-and-GA-algorithm
- 非线性规划和ga算法求解函数极值，提高非线性规划的优化能力-Nonlinear programming and GA algorithm to solve the extreme value of function, improve the optimization ability of nonlinear programming
100-Gbps-DP-QPSK-System-with-DSP
- 基于OptiSystem上的DP-QPSK系统DSP算法-DP-QPSK system based on DSP algorithms OptiSystem
gai4_2014_12_11_ny
- 混合动力汽车动力系统控制算法计算与优化中，使用动态规划算法优化汽车输出转矩MATLAB程序。(Simulation and Optimization of Power System Control Algorithm for Hybrid Electric Vehicle. Using Dynamic Programming Algorithm to Optimize Automobile Output Torque MATLAB Program.)
Desktop
- 简单的dp算法，实现起来很简单，没用的小心(a sample method of dp)
Desktop
- 实现简单的dp算法和程序，非常简单不需要看(Simple DP algorithm and procedures, very simple, do not need to see)
动态规划
- -动态规划(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
dp匹配
- 利用dp算法计算图像匹配视差，本程序利用vs2013+opencv2.4.9编写。(The disparity of image matching is calculated by DP algorithm. This program is written by vs2013+opencv2.4.9.)