搜索资源列表
Zoozy090322
- ACM Templates, including useful Algorithms, Graph, Math, DP, Search, Data Structures and so on
diban
- dp地板覆盖：2*1瓷砖覆盖10*n地板 1024个状态。状态转换矩阵的计算也需要动规。-the solution to floor covering
DP
- 动态规划的常见题型，动态规划的分类，状态DP的常见分类以及转移方程-Frequently Asked Questions in dynamic programming, dynamic programming, classification, status, a common classification of DP and the transfer equation
DP
- 动态规划解决问题 poj 1037 2385 1141 2336 1080 http://poj.org/-http://poj.org/problem?id=1037 Solve the problem A decorative fence
DP
- 动态规划另一个教程，很不错的。比刚才那个还很好呢的-something worth to be treasure..........
mycode
- hdu 3433 A Task Process(二分+dp验证）-hdu 3433 A Task Process (half+ dp verified)
DP
- 运用动态规划推求水库的调度问题，单库问题-Using the dynamic programming scheduling problem deduced reservoir
Dp
- 利用动态规划知识： 从三角形顶部到底部路径和最大-Dynamic programming knowledge: the path from the Ministry of the triangle at the top in the end and the largest
SPOJ
- Some solution of problems in SPOJ, all of them use DP technique to attack the problems.
Breaking_strings
- Knuth DP optimization trick ZOJ problem
binary
- 二叉树方法计算信用风险溢价 参数说明： V：公司资产市场价值初值 r:市场无风险利率 sigma：企业资产市场价值波动率 T:期限 num：二叉树层数 dp：违约点，即债权价值 输出结果： M:公司的风险溢价 -The binomial tree method to calculate the credit risk premium Parameters: V: t
umat-DP
- 用于计算abaqus中土的状态。是子程序。-The state used to calculate the abaqus Turkey. Is the subroutine.
DP-CPPM-Harding
- A UMAT of hardening DP-Model with closest point projection mehtod return mapping algorithm in ABAQUS Described in Chinese
DTW
- 在孤立词语音识别中，最为简单有效的方法是采用DTW（Dynamic Time Warping，动态时间归整）算法，该算法基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，是语音识别中出现较早、较为经典的一种算法，用于孤立词识别。HMM算法在训练阶段需要提供大量的语音数据，通过反复计算才能得到模型参数，而DTW算法的训练中几乎不需要额外的计算。所以在孤立词语音识别中，DTW算法仍然得到广泛的应用。 本程序是DTW算法的实现-In isolated word speech recog
topological-relationship-in-DP-
- 详细介绍了动态规划中的拓扑关系，深入理解动态规划算符-Details of the topology of dynamic programming operators
sgu262
- sgu262：Symbol Recognition(状压DP) 题目大意： 给出k个n∗ m的01矩阵Si，求出一个1尽量少的n∗ m的01矩阵P，满足k个矩阵与该矩阵的交互不相同，也就是说通过该矩阵能表示出给出的k个矩阵。-262. Symbol Recognition time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output:
DP
- DP简单例子：多源路径规划：求一座建筑物中每个电梯入口到所有电梯出口的最短路径-DP example：Multiple source shortest path
cPPand-DP
- 动态规划算法求解水库优化调度的C++程序，适用于水文专业或者水利专业的学生学习使用。-Use DP to solve reservoir operation problem
DP
- Dp is very good algorithm. You should try it.