Disjoint paths weight accumulating algorithm is proved to be effective in correlation computing by analyzing the results of the experiments.
分析实验结果发现，不相交路径权值累积算法能有效计算网络成员关联度。
A learning algorithm based on a hard limiter for feedforward neural networks (NN) is presented, and is applied in solving classification problems on separable convex sets and disjoint sets.
提出了基于硬限幅功能函数的前向神经网络的分类学习算法，并将其应用于可分凸集或不交集合的分类。
An algorithm for determining the perspective view of a set of disjoint simple objects in the plane on a two-dimensional mesh computer is presented with its time complexity given.
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
应用推荐