助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   heap structure 的翻译结果: 查询用时:0.167秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

heap structure
相关语句
  堆结构
     Asymptotic Optimal Sorting Algorithm Using Heap Structure
     采用堆结构的渐近最优整序算法
短句来源
     This article starts with the path finding principle,first introduces the tradition Dijkstra shortest path finding algorithm,then compares the Dijkstra algorithm efficiency of heap structure based with radices heap structure. We put forward a control strategy and algorithm for realization shortest path finding space using multiplayer map and hierarchical finding technology,Finally we integrate Zhanjiang electronic map with imitating experiment,the result is that hierarchical finding algorithm quickens up the shortest path finding algorithm greatly.
     文章从路径搜索的基本原理入手,首先介绍了经典Dijkstra最短路径搜索算法,分析比较了基于堆结构和基数堆结构的Dijkstra算法的搜索效率,从而提出了采用多层地图和分级搜索技术来实现对最短路径搜索空间的控制策略和算法,结合湛江市区电子地图进行对比实验,该算法有效地解决了最短路径搜索效率的问题。
短句来源
     This paper reviews the binary search tree and heap structure simply,and primarily analyzes the common and randomized treap data structure,and points out its limitation.
     本文对二叉树和堆结构进行了简单的回顾,分析了普通和随机Treap数据结构的特点,指出了它的局限性和不足。
短句来源
     By examining fast route planning algorithms used in vehicle location and navigation systems,a high efficient implementation method of shortest path searching algorithm was proposed in this paper,which is realized by utilizing radix heap structure,heuristic searching algorithm,and hierarchical searching method based on multiple layer map structure synthetically.
     在分析经典迪杰斯特拉最短路径搜索算法的最优实现的基础上 ,引入基数堆结构缩减了算法的时间复杂度 ,再利用启发式搜索和地图分级搜索技术减小搜索空间 ,从而获得最短路径规划算法的高效率实现 .
短句来源
     For the same algorithm,three different storage structures, out-of-order structure,bucket structure and heap structure,are adopted to save temporary label nodes. After comparison and analysis,the efficiency of Dijkstra algorithm,based on heap structure,is higher than the othertwo and is especially adaptable to large-scale networks.
     从经典的最短路径算法—Dijkstra算法入手,针对同一算法,分别采用三种不同的存储结构存储临时标号节点,通过对无序结构、桶结构、堆结构存储的分析与比较,提出基于堆结构的Dijkstra算法的效率高于其他两种算法,特别适合于大规模网络。
短句来源
更多       
  
     Asymptotic Optimal Sorting Algorithm Using Heap Structure
     采用结构的渐近最优整序算法
短句来源
     This article starts with the path finding principle,first introduces the tradition Dijkstra shortest path finding algorithm,then compares the Dijkstra algorithm efficiency of heap structure based with radices heap structure. We put forward a control strategy and algorithm for realization shortest path finding space using multiplayer map and hierarchical finding technology,Finally we integrate Zhanjiang electronic map with imitating experiment,the result is that hierarchical finding algorithm quickens up the shortest path finding algorithm greatly.
     文章从路径搜索的基本原理入手,首先介绍了经典Dijkstra最短路径搜索算法,分析比较了基于结构和基数结构的Dijkstra算法的搜索效率,从而提出了采用多层地图和分级搜索技术来实现对最短路径搜索空间的控制策略和算法,结合湛江市区电子地图进行对比实验,该算法有效地解决了最短路径搜索效率的问题。
短句来源
     This paper reviews the binary search tree and heap structure simply,and primarily analyzes the common and randomized treap data structure,and points out its limitation.
     本文对二叉树和结构进行了简单的回顾,分析了普通和随机Treap数据结构的特点,指出了它的局限性和不足。
短句来源
     By examining fast route planning algorithms used in vehicle location and navigation systems,a high efficient implementation method of shortest path searching algorithm was proposed in this paper,which is realized by utilizing radix heap structure,heuristic searching algorithm,and hierarchical searching method based on multiple layer map structure synthetically.
     在分析经典迪杰斯特拉最短路径搜索算法的最优实现的基础上 ,引入基数结构缩减了算法的时间复杂度 ,再利用启发式搜索和地图分级搜索技术减小搜索空间 ,从而获得最短路径规划算法的高效率实现 .
短句来源
     For the same algorithm,three different storage structures, out-of-order structure,bucket structure and heap structure,are adopted to save temporary label nodes. After comparison and analysis,the efficiency of Dijkstra algorithm,based on heap structure,is higher than the othertwo and is especially adaptable to large-scale networks.
     从经典的最短路径算法—Dijkstra算法入手,针对同一算法,分别采用三种不同的存储结构存储临时标号节点,通过对无序结构、桶结构、结构存储的分析与比较,提出基于结构的Dijkstra算法的效率高于其他两种算法,特别适合于大规模网络。
短句来源
更多       
查询“heap structure”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  heap structure
To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure.
      
We maintain a heap structure that keeps the size of the index structure linear with respect to the size of the database.
      
We have proposed a data structure called semi-heap which is a generalization of the traditional heap structure.
      
We introduce an optimal nlogn algorithm to determine a Hamiltonian path in a tournament based on the semi-heap structure.
      
When b and e meet, there is no event as there is no change in the heap structure.
      
更多          


A new sorting algorithm is given in this paper. It is designed by using heap structure, and we use recursion to implement the process of rearranging the heap. It not only has asymptotic optimal performance, but also unifies the algorithms in Referenees[1]and[5] as the special cases when it runs,

本文给出一个新的整序算法。该算法采用堆结构,重新堆化用递归实现。它不仅具有渐近最优性能,而且将文献[1]和[5]中的算法统一起来,作为它运行时的特例。

The heap structures are gaining remarkable progress in recent years. The researches on skew heap, Fibonacci heep and pairing heap performed by the Turing-award recipient R. E. Tarjan in 1986 and his co-authors have attracted more attention, in which the amortized computational complexity is used as measuring criteria. Many network optimization algorithms have been improved due to these achievements.

近年来,堆结构有一些重大的发展,其中以86年图灵大奖获得者R. E. Tarian及其合作者以折算复杂性(Amortized Computational Complexity)为度量标准所进行的一些研究尤其引人注目.这些发展使很多图论网络问题算法得到很大的改进.

This paper studied the composition and heap structure of insect community in bulk—storedwheat.432 samples of wheat were tested with trap detectors at the depth of 0—50cm,50—100cm,100—150cm and 250—200cm respectively and a diel record form 7:00—12:00,13:00—18:00,19:00—24:00and 1:00—6:00was taken respectively.The results indicated that there were 13 species of storedgrain insects,the dominant species was Sitophilus zeamais(Motsch.),in the amount of 87.5% ofinsects captured.The minor species were Sitotroga...

This paper studied the composition and heap structure of insect community in bulk—storedwheat.432 samples of wheat were tested with trap detectors at the depth of 0—50cm,50—100cm,100—150cm and 250—200cm respectively and a diel record form 7:00—12:00,13:00—18:00,19:00—24:00and 1:00—6:00was taken respectively.The results indicated that there were 13 species of storedgrain insects,the dominant species was Sitophilus zeamais(Motsch.),in the amount of 87.5% ofinsects captured.The minor species were Sitotroga cerealella(Olivet),Troctes divinatorius Mull.,Tyrophagus putrescetiae(Schrank)and Microbracon hebetor Say etc.The study showed the dynamic cha-racteristics of insect community in a diel cycle,the vertical distribution and the interspecific associationof stored grain insect species.The evenness(J′)and diversity indices(H′)measured were based on thediversity indices models by Shannon—Wiener(1949):Ⅱ′=-sum from i=1 to S PilnPi and J′=(H′)/(lnS)The J′ and H′ showed that the insect quantities in those heaps form 50 to 100 cm and 100 to 150cm indepth were grester then the insect quantities form 0—50 cm and 150 to 200 cm in depth.It showedthat those middle heaps preserved the relative stable inse(?)t community in the b(?)k—stored wheat.

本文报道了小麦散装粮堆昆虫群落的组成和结构。利用粮虫陷井检测器检测,共获得432个检测样。据捕获储粮昆虫及螨类初步分类统计,当年入库小麦散装粮堆仓库昆虫计有13种,优势种群为玉米象,占捕获总虫量的87.5%,次要种类有麦蛾、书虱、腐嗜酪螨、麦蛾萝蜂。本文还报道了仓虫群落昼夜活动动态,垂直分布及种间相互关系。根据 Shannon—Wiener(1949)关于测量多样性及均匀度公式:多样性指数 H′=-sum from i=1 to S P_iI_nP_l,均匀度J′=H′/(I_nS)测量了仓虫均匀度 J′,多样性指数 H′。研究结果表明,小麦散装粮堆50—100厘米和100—150厘米粮堆区间,仓虫群落均匀度和多样性较高,说明小麦散装粮堆中部区域仓虫群落组成相对稳定。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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