研究了具有大量错误结点的超立方体网络中的并行容错路由算法。
Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied.
本文研究了超立方体网络中容错路由算法的有效性及其保障机制。
We study validity and safeguard on fault tolerant routing on hypercube networks.
基于LIP和RSC的概念，提出了一个有效的超立方体网络单播容错路由算法。
Based on the conception of LIP and RSC, this paper proposed an efficient unicast fault-tolerant routing algorithm for hypercube networks.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
该文提出了一种新颖的在基于K元2 -立方体网络的SIMD计算机上运行的图像分块模板匹配并行算法。
This paper proposes a novel parallel algorithm for template matching of image division block based on a K-ary 2-cube network SIMD computer.
论文用两种方法给出了广义超立方体网络宽直径的具体证明，而两种方法的主要区别在于分别采用数学归纳法和直接构造法证明了不等式(1)。
In this paper, the wide-diameter of generalized hypercube is proved in two ways whose difference is to use mathematical induction and constructing method to prove the inequation (1).
你可以随意浏览下你最喜欢的网络漫画，和你的同事一起参加立方体战，或是看看有“每日笑话”的网页。
Hit the randomizer button on your favorite web comic, engage in cube warfare with a co-worker, or check out a website that offers a "Joke of the Day" service.
超立方体及其变体是一类具有良好的拓扑性质和网络参数的互连网络模型，所以关于它们的研究与应用在互连网络的研究中备受青睐。
The hypercube and its variations are a kind of interconnected networks model with better structure properties and network parameters, so it is favorite in research of interconnection.
局部扭曲立方体是一种新型的网络拓扑结构。
The locally twisted cube is a newly topological structure of network.
局部扭曲立方体是一种新型的互连网络拓扑结构。
Locally twisted cube is a newly introduced interconnection network for parallel computing.
本文给出互连网络上的广度优先搜索算法，并将其应用到螺旋立方体上。
In this paper, the breadth-first search algorithm on the interconnection network is given and applied to the twisted cube.
本文给出互连网络上的广度优先搜索算法，并将其应用到螺旋立方体上。
In this paper, the breadth-first search algorithm on the interconnection network is given and applied to the twisted cube.
应用推荐