1) neighborhood intersection
邻域交
1.
Based on the restriction of the conditions for the neighborhood union and neighborhood intersection,the following theorem was proven: if G is connected and the arbitrary pair of nonadjacent vertices(x,y),such that 1≤N(x)∩N(y)≤α-1,satisfies the condition N(x)∪N(y)≥n-δ-1,then G is traceable(α stands for the independent sets of G).
通过限定邻域并和邻域交的条件,证明了定理:如果对满足1≤N(x)∩N(y)≤α-1的任意不相邻的顶点x,y有N(x)∪N(y)≥n-δ-1,则G是可迹的(其中α表示连通图G的独立数);并根据结果给出连通图可迹的一个平凡的充分条件,此充分条件作为定理的推论说明定理在某种意义下是最好可能的。
2) neighborhood swapping
邻域交换
1.
To deal with this problem,a global neighborhood swapping strategy with dynamic adapatability was proposed.
为此,提出了一种具有动态调整能力的全局邻域交换策略,该策略有可能产生大量的不可行调度,需要一种筛选方法加以过滤。
3) Cycle exchange neighborhood
环交换邻域
1.
The main characteristics of the algorithm are as follows: 1)Cycle exchange neighborhood is used where several points are allowed to move simultaneously in an iteration,which is different from traditional neighborhoods such as swap and insert where only at most two points are permitted to move simultaneously in each iteration;2) a new "reinforced kick" is proposed for the clusterin.
提出一种新型的基于环交换邻域的迭代局部搜索算法(ILS),用于求解一类聚类问题。
4) exchanged-interpolation-operator
邻域交换内插
1.
The two new image zooming methods, wavelet zooming with enhanced coefficients and exchanged-interpolation-operator with median filter are studied in this paper.
对两种新图像放大算法,增强系数小波放大方法和带中值滤波的邻域交换内插方法进行了研究。
5) mixed new fre chet space
交新型邻域空间
6) wavelet-based zooming method
邻域交换插值
补充资料：邻交
1.邻居故旧。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条