搜索资源列表
XCSR_DE1.0
- - XCS for Dynamic Environments + Continuous versions of XCS + Test problem: real multiplexer + Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts. +Reference papers: H.H.
HW2.rar
- we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.,we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic pro
LCSp2264
- 动态规划的代码~LCS存路径DP：）状态压缩-Dynamic programming code path ~ LCS deposit DP:) compression status. .
3
- 采用动态规划算法求最长公共串，LCS算法经典中的经典-A dynamic programming algorithm seeking longest common string
dongtaibianliang
- 动态规划中的lcs算法c++代码，可以作为lcs算法的参考代码 -Dynamic programming the lcs algorithm c++ code lcs algorithm can be used as a reference code
Lcs
- 求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。-Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.
LCS
- 该程序用于求两个序列的最长子段，通过动态规划算法，记录子问题的结果，进而求出最终的最长子段。-The procedure used to find the longest sequence of two sub-sections, through dynamic programming algorithm to record the results of sub-problems, and then find the longest sub-section final.
LCS_Dynamic-planning
- 动态规划应用 动态规划算法解最长公共子序列LCS问题-Dynamic programming dynamic programming algorithm for solving the longest common subsequence LCS problem
lcs
- 用python实现了最长公共子序列LCS代码，分别应用递归方法和动态规划实现。并且实现了三个字符串的最长公共子序列。-Using Python to achieve the longest common subsequence of LCS code, respectively using recursive method and dynamic programming. And the realization of the longest common subsequence of three
源代码
- 大数据应用中基于支配点的mlcss算法设计与实现，程序中设计了三条字符串，查找他们之间的最长公共子序列。相对于传统的动态规划法，基于支配点思想具有更加高效的效率。(The design and implementation of mlcss algorithm based on dominant point in large data application, three strings are designed in the program to find the longest common