语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。
The semantic cache consists of disjoint semantic regions, and each semantic region includes a description and a corresponding data pointer.
通过将集列分成有限个互不相交的子集列，给出了求集列的上限集和下限集的新方法。
Through set sequence is resolved into finite mutually disjunct subsets, the new method to solve the limit superior and limit inferior of set sequence is give.
PLS算子通过聚类分析将种群分割为互不相交的邻域子种群，对每一个子种群应用单纯形法进行并行局部搜索。
PLS partitions the population into a group of disjoint subpopulations by cluster analysis, then USES simplex method to search local optima in each subpopulation in parallel.
应用推荐