Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - lcs

Search list

[Compress-Decompress algrithms] dongtaibianliang

Description: 动态规划中的lcs算法c++代码，可以作为lcs算法的参考代码 -Dynamic programming the lcs algorithm c++ code lcs algorithm can be used as a reference code
Platform: | Size: 262144 | Author: 于明静 | Hits:

[Delphi VCL] LCS

Description: 能源是人类赖以生存和发展的基础，是经济社会可持续发展的重要物质基础。近两年，能源约束矛盾日益突出。 节能是个老话题，今天，节能并没有成为历史，高速前进的国民经济和走可持续发展之路的国家战略，为节能赋予了新的时代内涵，增添了新的历史使命。 　　当前，煤、电、油、运全面紧张，价格大幅度上涨，石油对外依存度不断提高，能源供应紧张已经成为经济社会发展的重要制约因素之一。严峻的形势再次提醒我们，保证能源供给依然是未来中国必须面对的最复杂难题之一。节能是推动经济社会可持续发展的必然选择。 　　在目前电力能源紧张的严峻形势面前，本方案的关键是节约能源，提高路灯管理水平，“在保证照明效果下节电”。在确保灯光系统功能的正常发挥的前提下，通过提高终端用电效率和优化用电方式，在完成同样用电功能的同时减少电量消耗和电力需求，达到节约能源和保护环境，实现低成本电力服务。 -Energy is the basis of human survival and development, is an important material foundation for sustainable economic and social development. In the past two years, energy constraints have become increasingly prominent. Energy conservation is an old topic, today, energy-saving and did not become a thing of the past, to speed ahead of the national economy and take the road of sustainable development of national strategies for energy conservation gives new meaning to add a new historical mission. , Coal, electricity, oil and transportation are fully tight, prices have increased substantially, continuously improve the dependence on foreign oil, energy supply has become one of the constraints of the economic and social development. The grim situation reminds us once again, to ensure energy supply is still the future of China must face one of the most complex problems. Energy conservation is to promote sustainable economic and social development of the inevitable choice.
Platform: | Size: 5173248 | Author: 林生 | Hits:

[Console] HDOJ-1080--LCS

Description: HDOJ 1080 动态规划题目。欢迎各种讨论交流。-The dynamic programming topics HDOJ 1080. Welcome discussions AC.
Platform: | Size: 1024 | Author: violet | Hits:

[Other] lcs

Description: 动态规划 最长子字符串匹配 可以输出多个匹配的子字符串 算法导论-Dynamic programming longest substring matching substring can output multiple matches Introduction to Algorithms
Platform: | Size: 5120 | Author: vivian | Hits:

[Data structs] LCS

Description: 寻找最长公共子序列的的VC++实现，使用VC6编写，采用了MFC库；输入两个字符串，输出最长子序列长度和最长子序列都有哪些-Find the longest common subsequence VC++ achieved using VC6 prepared using the MFC library What two input strings, the output longest sub-sequence length and the longest subsequence
Platform: | Size: 2204672 | Author: sinix | Hits:

[JSP/Java] LongCommonSubstrng

Description: 算法问题，求公共最长自序列，采用动态规划求最优解。-LCS Question DP
Platform: | Size: 1024 | Author: 殷成健 | Hits:

[Other] dynamic-programming

Description: 《算法艺术与信息学竞赛》 45道动态规划题目 【POJ1141】括号序列 【POJ1191】棋盘分割 【SPOJ196】决斗 【AOA】跳舞机 【AOA】积木游戏 【AOA】艺术馆的火灾 【AOA】机器人的名字 【UVa10559】方块消除 【AOA】公路巡逻 【POJ1074】并行期望值 【AOA】高性能计算机 【AOA】模板匹配 【AOA】不可解码的编码 【AOA】青蛙的烦恼 【AOA】排列问题 【AOA】最优排序二叉树 【POJ1038】 Bugs公司 【UVa10531】迷宫统计 【AOA】贪吃的九头龙 【AOA】快乐的蜜月 【AOA】移动机器人 【UVa10271】佳佳的筷子 【AOA】偷懒的工人 【AOA】铁路调度 【POJ1691】平板涂色 【POJ1947】道路重建 【ZJUxxx】圆和多边形 【AOA】铁球落地 【UVA10118】免费糖果 【AOA】丢三落四的老鼠 【AOA】最长公共子序列问题 【UVA10635】排列的LCS问题 【UVAxxx】最长上升子序列问题 【UVAxxx】最优二分检索树问题 【POJ1180】任务调度问题 【AOA】序列分割问题 【AOA】多排列的LCS 【POJ1159】回文词 【AOA】友好城市 【POJ1160】邮局 【AOA】基因串 【POJ1946】奶牛转圈 【AOA】元件折叠 【AOA】 DNA序列 【AOA】最优布车方案 -" Algorithmic art and information science competition" 45 dynamic programming problem
Platform: | Size: 148480 | Author: 贾诩 | Hits:

[JSP/Java] LCS

Description: BUS POINT ON SALE ON JAVA
Platform: | Size: 14336 | Author: smurfluchu | Hits:

[Data structs] LCSSolveCommonSequence

Description: 用备忘录方法求两个序列的最长公共子序列,并对LCS的过程进行详细的格式化的输出，最后输出最长公共子序列及其长度。-Memorandum method for solving two sequences with the longest common subsequence
Platform: | Size: 2048 | Author: fasf | Hits:

[JSP/Java] lcs

Description: 求两个序列的最长公共子序列 算法导论课程小设计；带界面-algorithm project HITSZ irvingluo
Platform: | Size: 3072 | Author: irvingl | Hits:

[Data structs] LCS

Description: 我写的一个最长公共子序列的C语言代码，参照了算法导论上的介绍。-I wrote a longest common subsequence of C language code, referring to the presentation on Introduction to Algorithms.
Platform: | Size: 3683328 | Author: 郭佳 | Hits:

[JSP/Java] lcs

Description: 随机生成两个长度为1000的字母序列，利用动态规划算法实现求最长公共子序列，并输出最长公共子序列的长度，一般是320左右。-Two randomly generated sequence of letters of length 1000, the use of dynamic programming algorithm for the longest common subsequence, and the output length of the longest common subsequence, typically 320 or so.
Platform: | Size: 2048 | Author: eating | Hits:

[Data structs] Lcs

Description: 求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。-Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.
Platform: | Size: 1024 | Author: wutong | Hits:

[Algorithm] lab4

Description: 最长递增子序列 问题描述： 随机生成小于等于n的自然数的一个序列， 输出其最长递增子序列（任意一个即可）。 n 分别取 1000，3000，10000。 例： n=5 随机序列为 5 1 4 2 3，正确输出为1 2 3， 即长度为3的递增子序列。 提示：参考LCS，思考能否达到时间复杂度（O(nlogn)） -Longest increasing subsequence problem description: randomly generate a sequence of less than or equal to n natural numbers, the output of its longest increasing subsequence (any one can). n were taken 1000,3000,10000. Example: n = 5 random sequence of 51 423, the correct output is 123, ie increasing subsequence of length 3. Hint: LCS, thinking can achieve time complexity (O (nlogn))
Platform: | Size: 1024 | Author: zero | Hits:

[Algorithm] Lcs_Nakatsu

Description: 最长公共子序列的Nakatsu算法 　　最长公共子序列(Longest Common Subsequence，LCS)是将两个给定字符串分别删去零个或多个字符后得到的长度最长的相同字符序列。 -Nakatsu longest common subsequence algorithm is the longest common subsequence (Longest Common Subsequence, LCS) is given two strings are deleting zero or the same as the length of the longest sequence of characters obtained after multiple characters.
Platform: | Size: 2048 | Author: whchensir | Hits:

[Data structs] lcs_length

Description: lcs-search 查找两个字符串的最长公共子串-implementation of searching maxium sub-sequence of two character string.
Platform: | Size: 1024 | Author: jason | Hits:

[Data structs] LCS

Description: 该程序用于求两个序列的最长子段，通过动态规划算法，记录子问题的结果，进而求出最终的最长子段。-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.
Platform: | Size: 1024 | Author: 朱江 | Hits:

[Windows Develop] LCS

Description: 在C++ Builder环境下比较两个字符串，并取出其中最长的公共子串。-In C++ Builder environment to compare two strings and remove one of the longest common subsequence.
Platform: | Size: 347136 | Author: 周军 | Hits:

[Data structs] CHAUNGYUSHUZUDEYINGYING

Description: 串和数组的应用——编辑距离ld与求最长公共子串lcs算法(动态长度)-IT IS
Platform: | Size: 2048 | Author: 刚刚 | Hits:

[Other] LCS_Dynamic-planning

Description: 动态规划应用 动态规划算法解最长公共子序列LCS问题-Dynamic programming dynamic programming algorithm for solving the longest common subsequence LCS problem
Platform: | Size: 2048 | Author: 安静风 | Hits:
« 1 2 ... 5 6 7 8 9 1011 »

CodeBus www.codebus.net