1) time divided network
时分割网络
2) network partition
网络分割
1.
The two strategies frequently used to realize parallel shortest path algorithms in transportation(network,)network duplication strategy and network partition strategy,are discussed as well as their individual advantages and(disadvantages.
接着讨论了交通网络分析中最短路径并行算法常用的两种实现策略以及各自的优缺点;分析了影响网络分割策略并行算法性能的3个主要因素:最短路径算法选择、网络分割及终止检测方法。
2.
CJNSH utilizes connectivity degree information of the node with using up power and alternate selection algorithm and effectively improves the network partition problem.
该文针对自组网中网络的连通生存时间(从网络开始构成到产生网络分割的时间)问题,提出了一种基于连通性判断的网络自愈合算法(CJNSA)。
3.
Referring to the characteristic of different density among the nodes in the routing network, an algorithm of loop network partition is presented, in which the whole network is hierarchically divided into several resolvable sub-networks, a.
针对版图线网网络关联密集度不均衡的特点,本文提出了一种层次化网络分割算法,将全局网络按层次分割成可求解子网,并利用等效子网算法实现多观测点快速计算。
3) network division
网络分割
1.
A network division model for wireless sensor networks;
一个无线传感器网络的网络分割模型
2.
Based on network division strategy it will be effective and feasible to solve practical problems.
针对Dijkstra算法在实际应用中遇到结点多浪费内存空间,系统效率降低的问题,采用网络分析方法,对最短络算法进行分类和评述,结合铁路交通网现况进行网络分析,以此为基础在网络分割策略下采用Dijkstra算法解决实际问题是有效的、可行的。
3.
(3) By analysis of the graph-based Depth First Search(abbreviation for DFS) of network division,we propose a method to access the network topology based on the algorithm.
(2)研究蠕虫传播和网络规模之间的关系,为网络分割下的蠕虫传播抑制提供可行的思路。
4) network segment
网络分割
5) slotted envelope network
时间片分割法网络
6) community finding
子网络分割
补充资料：Dedekind分割
Dedekind分割
Dedekind cut
D日加脑目分割[D汕如目cut;皿e八eKou皿。即ee，e。。e]，分割(cut) 把实数集R(或有理数集Q)分割成两个非空集合A和B，其并为R(或Q)，并使得对任何a6A和be及都有a
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条