搜索资源列表
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-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 incomparab
zero_one_question
- 算法中的经典问题：0——1 背包问题 在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem
multiStageGraph
- 使用动态规划求多段图的C++源程序，用于满足最优化问题且问题能转换成一个有向图问题的求解，可以直接运行！-The use of dynamic programming for multi-stage plan of C++ source code, designed to meet the optimization problem and the problem can be converted into a directed graph to solve the problem, you ca
lcs
- 一道经典的动态规划题目 浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
engdemo
- the classic pattern recognition algorithms, dynamic clustering algorithm k mean using Matlab programming, as well as classification of the class analysis
dynamic
- 动态规划算法的一些归纳和应用，方便各位学习用，有背包问题，最长公共字串问题，等。-Some of induction dynamic programming algorithm and applications, ease of learning to use, there are knapsack problem, the longest string of public issues, and so on.
Dynamic-division-algorithm
- 这是一个 动态分合排样算法例子，十分有用的，对于初学者很有帮助的。-This is an example of dynamic division and layout algorithm is very useful, very helpful for beginners.
dynamic
- 算法，用c++实现动态规划算法的背包问题（在VS2008平台上）-Algorithm, using c++ dynamic programming algorithm for knapsack problem (in VS2008 platform)
Dynamic-programming
- 动态规划算法的相关文档。动态规划算法可用于很多方面，比如立体匹配等。-Dynamic programming algorithm documentation. Dynamic programming algorithm can be used in many aspects, such as stereo matching.
dynamic
- 动态规划法解决经典背包问题，C语言实现。-Classic dynamic programming method to solve the knapsack problem, C language.
dynamic-presentation
- 动态演示数据结构的各种算法，包括顺序表、链表、栈、队列、串、数组、树、图等。-Dynamic presentation of various algorithms data structures, including the sequence tables, linked lists, stacks, queues, strings, arrays, trees, graphs and so on.
Dynamic
- 求最长公共自序 列，动态规划算法求最长公共自序 列，动态规划算法 -Preface to seek the maximum demand up to the public from the public sequence, dynamic programming algorithm for getting up to the public from the sequence, dynamic programming algorithm for getting the longest sequen
dynamic-of-acm
- 简单的动态规划，怎么利用数据冗余，实现动态规划，得到高效的算法-Simple dynamic programming, how to use data redundancy, dynamic programming, efficient algorithms are
minimum-changes(dynamic-program)
- 最少零钱问题，找零钱问题，动态规划经典算法-the question of minimun changes for a given money,dynamic programming
Dynamic-Programming
- 动态规划，租用游艇问题，长江游艇俱乐部在长江上设置了n个游艇出租站1，2，…，n。-Dynamic programming, rental boats the problem, the Yangtze River Yacht Club, set in the Yangtze River on a yacht rental station n 1,2, ..., n.
Lecture-of-Dynamic-Programming-(DP)
- 上算法设计课课同学自己准备的讲座，ppt通过举例详细介绍了动态规划的原理，并附有实现源码与测试数据-Division on the algorithm design students prepare their own lectures, ppt described in detail by way of example the principles of dynamic programming, together with source code and test data to achiev
VCPPsgle-chain-dynamic-presentatin
- 基于MFC的单链表动态演示程序，有添加，插入、删除，移动节点等功能，对数据结构和VC++的初学者都有很好的帮助！-MFC-based single chain dynamic presentation procedures, add, insert, delete, move nodes and other functions, data structures and VC++ has a good help for beginners!
Dynamic
- 使用动态规划解决背包问题，用C++语言实现-Knapsack problem using dynamic programming to solve, using C++ language
dynamic-queue-and-stack
- 动态实现堆栈和队列的添加、删除等的操作，C代码实现-Dynamic realization of the stack and queue add, delete and other operations
Dynamic-Programming
- 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsac