助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   二进制搜索树 的翻译结果: 查询用时:0.037秒
图标索引 在分类学科中查询
所有学科
互联网技术
更多类别查询

图标索引 历史查询
 

二进制搜索树
相关语句
  “二进制搜索树”译为未确定词的双语例句
    According to the basic idea of P-Grid, peers exchange their information and split the search space when they meet each other. At last, each peer is only responsible for an interval of the whole search space and makes responses to the query requests for the data in this interval.
    根据P-Grid基本思想,节点间每次相遇就交换双方的信息,对搜索空间不断进行分割,使每个节点负责管理某一区间上数据信息并负责响应针对这些数据的查询请求,最终搜索空间的划分状态在逻辑上可以用一棵二进制搜索树表示。
短句来源
    It brings forward a binary-tree searching anti-collision algorithm based on dynamic adjustment. Using this algorithm,the tags collision problem can be solved effectively.
    提出一种动态调整二进制搜索树防冲撞算法,可以有效解决RFID标签冲突问题。
短句来源
查询“二进制搜索树”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  binary search tree
This paper gives the least upper bound on the weighted path length of an optimum lexicographic (alphabetic) binary search tree as a function of n, given the total weight of the n terminal nodes and the n-1 internal nodes to be one.
      
When searching unsuccessfully for a fixed element in a random binary search tree, the number of comparisons made whose result is "less" is independent from the number of comparisons whose result is "greater".
      
A modified max-entropy rule is proposed for constructing nearly optimum binary search tree in the case of ordered keys with given probabilities.
      
We show that the cost of an optimal binary search tree can vary substantially, depending only on the left-to-right order imposed on the probabilities.
      
For example, for the random binary search tree constructed from a random permutation of 1,..., n, it is shown that Hn/(c log(n)) tends to 1 in probability and in the mean as n→∞, where Hn is the height of the tree, and c =4.31107...
      
更多          


The RFID technology and the unavoidable collision problem are analyzed detailedly in this article.It brings forward a binary-tree searching anti-collision algorithm based on dynamic adjustment.Using this algorithm,the tags collision problem can be solved effectively.The advantage will be proved by the analysis of time and space complexity.The algorithm has important significance for the development and application of RFID.

论文详细介绍了RFID技术,并针对RFID技术中不可避免的碰撞问题进行分析。提出一种动态调整二进制搜索树防冲撞算法,可以有效解决RFID标签冲突问题。在时间复杂度和空间复杂度等方面比较验证其优越性。该算法对于RFID技术的发展和推广有重要意义。

 
图标索引 相关查询

 


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

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