助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[130]条 当前为第1条到20条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
tree search
The proposed tree search decoder decides to which sub tree the receive signal belongs by searching in the set of subtree roots.
      
The adjacent subtree joint decoder performs joint search in the selected sub tree and its "surrounding" subtrees, which improves the Bit Error Rate (BER) performance of purely tree search method.
      
Simulation results demonstrate that the proposed scheme has similar Bit Error Rate (BER) performance to that of the known Iterative Tree Search (ITS) detection.
      
Game tree search is the core of most attempts to make computers play games.
      
It is shown here that an improved quantum search algorithm can be devised that exploits the structure of a tree search problem by nesting this standard search algorithm.
      
Two mathematical formulations are considered where one is used to develop a tree search procedure while the other is used to develop a lower bound that can speed up the tree search procedure.
      
Furthermore, a composite heuristic combining the tree search procedure and pair-wise exchange heuristic is proposed for large size problems.
      
We tested, through field experiments and simulation models, the hypothesis that fruit-searching tephritid fruit flies adjust their within-tree search persistence according to the sequence and timing of encounters with parasitized (i.e.
      
The proposed tree search and pruning technique reduces the search space considerably without losing too much recognition performance compared to an exhaustive search.
      
This bound is imbedded in a B>amp;amp;B tree search to provide another exact solution procedure.
      
Branch and win: OR tree search algorithms for solving combinatorial optimisation problems
      
We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence.
      
This paper establishes an upper bound on the time complexity of iterative-deepening-A* (IDA*) in terms of the number of states that are surely-expanded by A* during a state space tree search.
      
Execution of logic programs by iterative-deepening A* SLD-tree search
      
In this paper, we describe an approach to the construction of protein backbone folds using experimental dipolar couplings based on a bounded tree search through a structural database.
      
CASA: An Efficient Automated Assignment of Protein Mainchain NMR Data Using an Ordered Tree Search Algorithm
      
We introduce a new depth-first ordered tree search method of automated assignment, CASA, which uses hand-edited peak-pick lists of a flexible number of triple resonance experiments.
      
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
      
The second approach performs a CP based heuristic tree search.
      
Numerical results show the superiority of the hybrid algorithm in comparison to CP based tree search and column generation alone.
      
 

首页上一页12345下一页尾页 

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