长路径的英文

• long-path

• "长"英文翻译    older; elder; senior
• "路径"英文翻译    way; route; trajectory; path ...
• "长路" 英文翻译 :    a long road; long way
• "走长路" 英文翻译 :    have a long walk
• "路径" 英文翻译 :    1.(道路) way; route; trajectory; path; tail; travel2.(门路) method; ways and means 成功的路径 way to success
• "波长路由器" 英文翻译 :    wr wavelength router
• "长路程回声" 英文翻译 :    long path echo
• "长路环绕" 英文翻译 :    the long way around
• "长路将尽" 英文翻译 :    iris
• "长路尽头" 英文翻译 :    end of the rodo
• "长路漫漫" 英文翻译 :    a long long road; a long way gone; a long way up; long way to go; the long and winding road; the long road
• "长路迢迢" 英文翻译 :    dong way to go; long long way to go[/color; long way to go
• "道别的长路" 英文翻译 :    long way to say goodbye
• "共创成长路" 英文翻译 :    paths
• "漫漫长路" 英文翻译 :    long way round; long way to go; the long and winding road; the long road back
• "延长路站" 英文翻译 :    yanchang road (shanghai metro)
• "蜿蜒长路" 英文翻译 :    lang and winding road
• "长路慢慢变冷" 英文翻译 :    the road gets cold
• "长路慢慢变冷 t" 英文翻译 :    the road gets cold
• "目标成长路线" 英文翻译 :    target growth path
• "波长路由选择节点" 英文翻译 :    wrn wavelength routing node
• "波长路由选择网络" 英文翻译 :    wrn wavelength routing network
• "通往成功的长路" 英文翻译 :    long road to success
• "五号干线延长路段" 英文翻译 :    road extension
• "有声读物 漫漫长路" 英文翻译 :    a long way down

• It is the longest path through the project
  它是通过项目的最长路径。
• In my experience , this approach will be at least 2 - 3 times as fast in most situations , and geometrically faster ( 10 + times as fast ) on longer paths
  以我的经验，在大多数解决方案中，这个方法会快至少2 - 3倍，在长路径上更快（ 10倍以上） 。
• This is what the professionals do , using large areas for long paths , and then switching to finer searches using smaller squares / areas when you get close to the target
  这就是专业人士的做法，对长路径使用大的区域，然后当接近目标时切换到使用小一些的方块/区域的精确搜索。
• And because the xml storing is an indispensable component in cms , the article proposed an efficiently xml storing strategy from the perspective of constraint schema of xml instance based on non - equal path analysis
  另外，在内容管理中xml的存储已经成为一个必要的组成部分。文章提出了一种新颖的存储策略，这种方法基于非等长路径的xmlschema分析，最后通过一系列的测试证明了其高效性。
• The paper will study the upper questions based on the two interconnection networks . first , we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second , with the rapid progress in vlsi , the failing probability of processors and links is very low , the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary , we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time , the result is the same as the hypercube . we also give a related algorithm in o ( n ) time , and the length of the longest path ; third , we apply cluster faun tolerance introduced by q . - p
  根据menger定理， n -维交叉立方体可以容纳n - 1个故障顶点，我们给出了它的时间复杂度为o ( n )的容错路由选择算法及其最长路径长度分析；在此基础上本文证明， n -维交叉立方体的条件连通度为2n - 2 ( n 2 ) ，并给出了相应时间复杂度为o ( n )的算法及其最长路径长度；除此之外，本文还证明当n -维交叉立方体中的故障簇个数不大于n - 1 ，其直径不大于1 ，故障顶点总数不超过2n - 3 ( n 2 )时，交叉立方体中任两个无故障顶点都至少有一条可靠路径。
• For the next interconnection network , we proved the connectivity of the n - enhanced crossed cube is n + 1 , and its conditional connectivity is 2n ( n > 3 ) provided that all the neighbors of each professor do not fail at the same time , which is better than the hypercube and the crossed cube , two related algorithms in o ( n ) time are also given ; more , we proved that the n - enhanced crossed cube can tolerate as many as n faulty clusters of diameter at most 1 with at most 2n - 1 faulty nodes in total ( n > 3 ) , which is better than the hypercube and the crossed cube also
  本文证明n -维加强交叉立方体的连通度为n + l ，条件连通度为zn ( n > 3 ) ，簇容错特征数为( n ， l ， zn ) ， ( : 1 > 3 ) ，这些性质都比交叉立方体的更优越。更进一步，木文也给出了加强交叉立方体的基于连通度的，条件连通度的时间复杂度为o ( n )的容错路由选择算法及最长路径长度。
• Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ) , the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization , where the dynamic programming based solution space model and the longest path based optimization model are developed
  摘要通过分析概念设计方案求解问题与旅行商问题的相似性，将方案求解问题转化为组合优化的最优路径问题，建立了基于动态规划的解空间模型和基于最长路径的优化模型。
• Our simulation shows that the path will not be improved obviously with the further increase of k , when it reaches a certain value . in addition to this , the dissertation shows that when rh = 3 and rh = 4 , the results are similar . 2 . in regard to the application layer routing of tree - based p2p multicast , the dissertation presents a new kind model of spanning tree , named dcmd , in which the path delay , the
  2 .在基于树的p2p组通讯的传输路径方面,抽象了一个新的生成树问题? ? dcmd问题,该问题同时考虑了线路延迟、主机的发送/转发延迟和每个主机的工作负载有限三种情况,可以更加全面地刻画出构建在应用层的p2p组通讯;证明了这个问题属于np - hard ;提出了基于最大度和基于最长路径两类启发式算法作为解决该问题的途径。