搜索资源列表
3
- 3.1 最长公共子序列问题 最长公共子序列（动态规划） 实验数据：input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。 -3.1 the longest common subsequence problems longest common subsequence (dynam
src
- 基于动态规划算法，用java实现的自动对联程序-Automatically couplet procedures based on dynamic programming algorithm, implemented in Java
KNAPSACK
- 背包问题,动态规划实现了01背包和贪心算法部分背包-Knapsack problem, 01 backpack and full backpack
dongtaiguihua
- 关于动态规划的原代码，可以用于学习动态规划算法-Dynamic programming source code, can be used to study the dynamic programming algorithm
acm
- acm比赛的动态规划算法总结，很实用的，大家一起学习-happy every
floyd
- 动态规划的算法，求解所有的路径之间的最短路径，时间复杂度在O(n3)-Dynamic programming algorithm for solving the shortest path between all paths, the time complexity of O (n3)
Algorithm_SA
- 用java实现的线性序列对齐算法（算法->动态规划的作业）-Java implementation of a linear sequence alignment algorithm (algorithm- dynamic programming job)
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
CoinsChange
- 硬币找零问题 动态规划算法 JAVA源代码-Coin change for the dynamic programming algorithm for Java source code
Combinatorial-mathematics-courseware
- 回朔法的讨论，鸽笼原理，Ramsey问题。排列组合问题，容斥原理，母函数，递归关系，线性规划，动态规划。Polya原理-Discussion back method, the pigeonhole principle, Ramsey problems. Permutations and combinations, the principle of inclusion and exclusion, generating functions, recursion relations, linear
Computer-algorithm-designanswer-
- 计算机算法设计，递归与分治策略，动态规划，贪心算法，回朔法，分支界限法，线性规划与网络流，NP完全问题与近似算法等-Computer algorithms, recursive and the strategy of divide and conquer, dynamic programming, greedy algorithms, backtracking method, branch and bound method, linear programming and network flow
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
dynamic_programming_3_16_a
- 动态规划的程序（Kirk book）:A system is described by the first-order difference equation, find the optimal control values-Code for Kirk Dynamic Programming book 3-14 A system is described by the first-order difference equation, find the optimal control valu
poj1088
- poj1088解题报告，采用动态规划，-poj1088 problem solving reports, skiing and path maximum dynamic programming,
backpack
- 基础背包问题、用贪心算法求解最大价值问题、用动态规划算法求解最大价值问题-Basic knapsack problem, the greedy algorithm for solving the maximum value of the dynamic programming algorithm for solving the maximum value of
Battlecruiser.v1
- 清华大学智能体大赛AI 动态规划来做的 预判对方策略-Agent Competition, Tsinghua University AI
suanfa
- 用动态规划实现三角问题，用贪心算法实现装在问题和最短源路径问题-Triangle problems using dynamic programming, greedy algorithms installed in the path of the problem and the shortest source
TSHORTTh
- 本程序采用了动态规划的方法来来求最短路径的问题可直接使用。 -This program uses a dynamic programming approach to the shortest path problem can be used directly.
d2200060410y
- 动态时间规整（DTW）算法一种基于动态规划的思想，，解决了说话人不同时期发音长短、语速不一样的匹配问题。 -Dynamic Time Warping (DTW) algorithm based on the idea of dynamic programming, to solve the different periods of the speaker pronunciation length, speed is not the same match.
acm
- acm程序设计，动态规划，课件，源码，以及其他算法-acm programming, dynamic programming, courseware, source code, as well as other algorithms