助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[1]页 共[7]条 当前为第1条到7条
 

相关语句
tree searching
A principle of independence for binary tree searching
      
New approaches for understanding the asymptotic complexity of A* tree searching
      
In this paper, the kd-tree searching algorithm is used within a recent LSI implementation to reduce the time and computational complexity of query matching.
      
In this algorithm the character comparisons have been completely replaced by tree searching.
      
Minimax search is currently the standard method for game tree searching.
      
To label a line drawing, first achieve local consistency and then achieve global consistency by tree searching with depth-first backtracking.
      
We show that this task of assigning incidences can be viewed as a tree searching problem and two techniques for performing this search are discussed.
      
 

首页上一页1下一页尾页 

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