1) maximum set of public successor activities
最大公共紧后工序集
4) standard schedule of successor activities
标准紧后工序表
1.
This paper puts forward a method to convert ordinary schedule of successor activities into standard schedule of successor activities,and gives an applied example of this method.
提出了一种将普通紧后工序表转化为标准紧后工序表的方法 ,列举了一个该方法的应用实
5) Schedule of Ordinary Successor Activities
普通紧后工序表
1.
A Method of Drawing an AOA Network Diagram according to the Schedule of Ordinary Successor Activities;
一种根据普通紧后工序表绘制箭线式网络图的方法
6) longest common subsequence
最长公共子序列
1.
A new algorithm for finding length of the longest common subsequence;
求最长公共子序列长度的一个新方法
2.
Solving the longest common subsequence (LCS) of any given strings is one of the basic and important research problems in computer science.
求解任意给定的两个字符串的最长公共子序列(LCS)的问题是计算机科学中一个基本和重要的问题,它是一种仅仅允许对模式和正文进行插入和删除编辑操作的近似串匹配问题。
补充资料：逼近紧集
逼近紧集
approximately-compact set
逼近紧集{aPpro%im班ly一~p叭set;aun即枕“~皿。“。MI翻既rl《吧M”仪服。cr即} 具有逼近紧性(approximate。)mpactness)的凳:合、任何逼近紧He6L批B集七的度量射影都是连续的空间L。(0
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条