给定一组区间，计算最少需要移除多少区间，才能使剩余区间两两互不相交。
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。
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.
介绍了一种优化方法——围法，该方法的基本原理是利用函数等值线封闭且互不相交。
In this paper, a new optimization method named surround method is introduced. and Its bases upon isoclines of function are closed and doesn't intersect with each other.
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.
设P和Q为平面内两个互不相交的简单多边形 ，若 P在平面内绕某点旋转 ，文中讨论了其旋转可移动性问题 。
Let P and Q be two nonintersecting simple polygons in the plane, this paper discusses the rotational movability of them if P rotates around a point and collides with Q .
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
应用推荐