助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   通路集合 的翻译结果: 查询用时:0.412秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

通路集合
相关语句
  path set
     This paper discusses an algorithm in a directed network to find out the path set P_(st) for the vertex pair v_s and v,, the path set P_(st) being solved is satisfied: if the path length is less than or equal to the shortest path adding in any constant DM, in whieh, DM is an arbitrarily selected and non-negative parameter.
     本文讨论在有向网络中,求V_s、V_t两顶点间通路集合P_(st)的一种算法,所求出的通路集合P_(st)满足:当通路长度小于或等于最短通路长加上某一常数DM时,此通路属于P_(st)其中,DM是可以任意选择的一个非负参数。
短句来源
  相似匹配句对
     CHANNEL'S STABILITY
     通路稳定度
短句来源
     The set
     集合(英文)
短句来源
     Collective Nouns
     集合名词
短句来源
     The mitochondrial pathways of apoptosis
     细胞凋亡的线粒体通路
短句来源
     In order to find out all Hamiltonian tours of a graph, this paper puts forward the concepts about H sets, H matrices joining product and path matrix, etc.
     为求出图的全部哈密顿回路,本文提出了H集合、连接积、H矩阵和通路矩阵等概念。
短句来源
查询“通路集合”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  path set
In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state, and then the sharp-product operation was used to construct the disjoint minimal path set of the network.
      
Using a 6 m mirror system an absorption path length of 1.2 km was realized under field condition just despite of the open path set-up.
      
In this study, a dynamic partitioning protection routing technique for routing a Fault Tolerant Path Set (FTPS) in a network is proposed.
      
Transport properties of superfluid 3He in aerogel are governed by a fixed mean free path set by the typical dimensions of the strand separation.
      
A path set is said to be minimal if the set cannot be reduced without loosing its status as a path set.
      
更多          


This paper discusses an algorithm in a directed network to find out the path set P_(st) for the vertex pair v_s and v,, the path set P_(st) being solved is satisfied: if the path length is less than or equal to the shortest path adding in any constant DM, in whieh, DM is an arbitrarily selected and non-negative parameter. If the parameter DM selected is equal to zero,the shortest path and its lengthfrom v_s to v_t may be found. Then, the algorithm in this paper may be considered as an extension of the Dijkstra's...

This paper discusses an algorithm in a directed network to find out the path set P_(st) for the vertex pair v_s and v,, the path set P_(st) being solved is satisfied: if the path length is less than or equal to the shortest path adding in any constant DM, in whieh, DM is an arbitrarily selected and non-negative parameter. If the parameter DM selected is equal to zero,the shortest path and its lengthfrom v_s to v_t may be found. Then, the algorithm in this paper may be considered as an extension of the Dijkstra's algorithm.The algorithm in this paper also provides the length of paths, the number of all paths between v_s and v_t, and the number of elements in P_(st) set, when the paths are found out.

本文讨论在有向网络中,求V_s、V_t两顶点间通路集合P_(st)的一种算法,所求出的通路集合P_(st)满足:当通路长度小于或等于最短通路长加上某一常数DM时,此通路属于P_(st)其中,DM是可以任意选择的一个非负参数。若选择DM等于零的话,则可求出V_s到V_t的最短通路及其长度,因此,本文的算法可以认为是对DijkstTa算法的一种推广。本文所提供的算法,在求出每一条具体通路时,也给出此通路的长度,并且给出由V_s到V_t间全部通路的数目以及P_(st)的元素数目。另外,还编制了一个实现这一算法的BASIC程序。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关通路集合的内容
在知识搜索中查有关通路集合的内容
在数字搜索中查有关通路集合的内容
在概念知识元中查有关通路集合的内容
在学术趋势中查有关通路集合的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社