Location:
Search - lcs dynamic
Search list
Description: 动态规划解决LCS-dynamic programming solution LCS
Platform: |
Size: 1566 |
Author: 胡凯 |
Hits:
Description: 动态规划解决LCS-dynamic programming solution LCS
Platform: |
Size: 1024 |
Author: 胡凯 |
Hits:
Description: 用动态怪话编写的有关最优公共秩序列问题的java程序-dynamic cynical remark prepared in the best public order out of java programs
Platform: |
Size: 1024 |
Author: |
Hits:
Description: LCS（最长公共子序列）问题可以简单地描述如下：
一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。例如，若X={A，B，C，B，D，B，A}，Y={B，D，C，A，B，A}，则序列{B，C，A}是X和Y的一个公共子序列，但它不是X和Y的一个最长公共子序列。序列{B，C，B，A}也是X和Y的一个公共子序列，它的长度为4，而且它是X和Y的一个最长公共子序列，因为X和Y没有长度大于4的公共子序列。
最长公共子序列问题就是给定两个序列X={x1,x2,...xm}和Y={y1,y2,...yn}，找出X和Y的一个最长公共子序列。对于这个问题比较容易想到的算法是穷举，对X的所有子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中记录最长的公共子序列。X的所有子序列都检查过后即可求出X和Y的最长公共子序列。X的每个子序列相应于下标集{1,2,...,m}的一个子集。因此，共有2^m个不同子序列，从而穷举搜索法需要指数时间。
-LCS (longest public sequences) can be simply described as follows : given a sequence of sequences in the sequence is deleted after some element of the sequence. Given two sequences X and Y, Z is another sequence of the X-Y sequence is the sequences, Z is said X and Y series of public sequences. For example, if X = (A, B, C, B, D, B, A), (Y = B, D, C, A, B, A), the sequence (B, C, A) X and Y is a public sequences, it is not X and Y in a public longest sequences. Sequence (B, C, B, A) X and Y is a public sequences, and its length is 4. but it is the X and Y for a public longest sequence, X and Y because no greater than the length of the four sequences in public. The longest public sequences problem is given two sequences X = (x1, x2, ...) xm and Y = (y1, y2, ... yn), to identify X and Y in a
Platform: |
Size: 4096 |
Author: 汤烈 |
Hits:
Description: - 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. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.-- XCS for Continuous Dynamic Environments Test versions of XCS problem : real multiplexer Experiments : XCS is explored in dynamic environments with di fferent magnitudes of change to the underlying concepts. Reference papers : H. H. Dam, H. A. Abbass, C. J. Lokan. Evolutionary Online Data Mining-an Investiga tion in a Dynamic Environment. 2005. accepted for a book chapter in Springer Series o n Studies in Computational Intelligence H.H. D am, H. A. Abbass, C. J. Lokan. Be Real! XCS with Continuous- Valued Inputs. IW LCS 2005. (International Workshop on Learning Classifi er Systems). Washington DC, June 2005.
Platform: |
Size: 22528 |
Author: 李恆寬 |
Hits:
Description: 最大公共子序列，利用动态规划实现
just enjoy it-The largest common sub-sequences, the use of dynamic programming realize just enjoy it
Platform: |
Size: 1024 |
Author: 里强 |
Hits:
Description: 最大公共子序列
采用动态规划发，下载即可运行，欢迎改正-The largest common sub-sequences using dynamic programming hair, download your run, welcome correction
Platform: |
Size: 1024 |
Author: 哈哈 |
Hits:
Description: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
Platform: |
Size: 269312 |
Author: 小波 |
Hits:
Description: 最优自序列问题，对动态规划有更深的理解，用C的方式实现-Since the issue of optimal sequencing of dynamic programming has a deeper understanding of the way using C
Platform: |
Size: 1024 |
Author: 王菲 |
Hits:
Description: 动态规划实现lcs-Dynamic programming to achieve lcs
Platform: |
Size: 879616 |
Author: hcsg |
Hits:
Description: 用LCS方法解决字符匹配问题，用到动态规划的思想。原创-LCS solution with matching characters, the idea of using dynamic programming
Platform: |
Size: 1024 |
Author: bohu |
Hits:
Description: we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.
Platform: |
Size: 132096 |
Author: burcin |
Hits:
Description: 一道经典的动态规划题目
浙江大学硕士生入学复试上机题
http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming
http://acm.hdu.edu.cn/showproblem.php?pid=1231
Platform: |
Size: 1024 |
Author: 陈子杭 |
Hits:
Description: 算法动态规划最长公共子序列的递归实现，并包括查找过程的体现-Dynamic programming algorithm for the longest common subsequence of the recursive implementation, and includes the process to find a manifestation of
Platform: |
Size: 123904 |
Author: 孙强 |
Hits:
Description: Longest common subsequence problem. It is dynamic approach based problem.
Platform: |
Size: 1024 |
Author: Preeti |
Hits:
Description: 利用动态规划技术和递推的办法，求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
Platform: |
Size: 963584 |
Author: 孙静 |
Hits:
Description: 算法设计与分析课程中用动态规划算法求解最长公共子序列问题，C语言写的，很实用，有b数组和c数组的输出，很适合初学者一步一步走程序。-Algorithm design and analysis programs using dynamic programming algorithm for solving the longest common subsequence problem, C language written, very practical, with b and c array array output, it is suitable for beginners step by step process.
Platform: |
Size: 1024 |
Author: 陈丽萍 |
Hits:
Description: LCS问题具有最优子结构和重叠子问题的性质，因此采用动态规划算法自底向上计算该问题的解，并输出求到的LCS。-LCS problem with sub-optimal substructure and overlapping nature of the problem, so a bottom-up dynamic programming algorithm for computing the solution of the problem, and the output request to the LCS.
Platform: |
Size: 1024 |
Author: zhdxch |
Hits:
Description: 算法导论中最长公共子序列的实现，采用动态规划方法-Introduction to Algorithms in the realization of the longest common subsequence, dynamic programming method
Platform: |
Size: 569344 |
Author: lin |
Hits:
Description: 利用动态规划算法寻找两个list中的最长公共子序列，并分别记录了最长公共子序列的在list中的结束位置-Dynamic programming algorithm to find the two list the longest common subsequence, and recorded the longest common subsequence of the end position in the list
Platform: |
Size: 529408 |
Author: 滕海明 |
Hits: