跳数的英文

• hocount
• hop

• "跳"英文翻译    jump; leap; skip; bounce
• "数"英文翻译    frequently; repeatedly
• "循环的问题也可用描述为跳数无限" 英文翻译 :    counting to infinity
• "跳水" 英文翻译 :    [体育] dive 高难度跳台跳水 variety high diving; 跳板跳水 springboard diving; 向前[后] 跳水 front [back] dive; 花式跳水 fancy dive; 燕式跳水 swallow dive; 跳水保护员 dive-keeper; 跳水表演 diving exhibition; 跳水池 dive pool
• "跳鼠亚科" 英文翻译 :    jerboas
• "跳水,潜水" 英文翻译 :    dive
• "跳鼠科" 英文翻译 :    dipodidae; jerboas
• "跳水，游水" 英文翻译 :    plunge
• "跳鼠" 英文翻译 :    [脊椎] jerboa
• "跳水板" 英文翻译 :    diving board; divingboard
• "跳示选" 英文翻译 :    jumpreference
• "跳水保护员" 英文翻译 :    dive keeper
• "跳式三辊机座" 英文翻译 :    jumping three-high stand

• Effect on the average number of hops with forwarding strategy in location - based routing
  基于位置的路由中转发策略对平均跳数的影响
• What is the maximum number of hops ospf allows before it deems a network unreachable
  在ospf协议中，最大多少跳数代表网络不可达？
• Through the statistical distributing of the hops , we can distinguish the legal packets and spoofed packets
  利用跳数的统计分布特性,达到区分合法包与伪造包的目的。
• It is testified by simulation implement that the minimal hop algorithm does improve the efficiency of the grid resources scheduling greatly
  通过算法仿真证明，最小跳数算法大大提高了资源调度的效率。
• The comparing simulations indicate the method is valid , and the physical hops and the latency of the chord network have been decreased by nearly half
  对比仿真试验结果表明了该方法的有效性, chord网络在物理跳数和反应时间两个方面都有明显的改进,平均降为原来的一半。
• By computer simulation , we compare the channel performance under different node distributions . objects we examined includes connectivity , hop count , collisons on channel and channel capacity
  包括不同分布情况下的网路连通性、链路跳数、信道冲突情况和信道容量。
• We adopt k shortest paths into routing and choose the best route in them considering link costs , links hops and the number of no - utilized wavelength in a link
  路由选择采用k条最短路径算法进行,备选路由集中首选最佳路由时考虑链路的代价,跳数和每一条链路上不可用波长数。
• Firstly , we find the resources in the breadth first search way , at the mean time , hop field is generated , and then , we schedule the resources according to the hop field
  本文提出一种新型的网格资源调度算法最小跳数算法，首先通过广度搜索遍历找到资源，并同时生成跳数场，再根据跳数调度资源。
• Based on the analysis of the test result , we can find that almost all of the network application can run in gear within a small - scale network where the relay hop count is no more than five hops
  基于对大量实验结果的分析,验证了在中转跳数不大于五跳的小规模网络情况下,各种网络应用程序都能很好的运行。
• The dijkstra algorithm of the least of hops is used for path calculated in olsr . but the protocol only tries its best to transmit data , not considering the state of wireless link
  它采用dijkstra算法计算跳数最短路径,并尽力而为地传送数据包,没有考虑无线链路时延、带宽等状态和节点拥塞程度,这样的路径计算方式已经不能满足用户对网络提供服务质量的要求。