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

图标索引 历史查询
 

树搜索方法
相关语句
  “树搜索方法”译为未确定词的双语例句
     A new approach for game tree searching based on the ordered weighted averaging (OWA) aggregation is presented.
     提出了一种基于有序加权平均(Ordered Weighted Averaging—OWA)的博奕树搜索方法.
短句来源
     State-tree search method searches all the success network states in a state-tree in order to calculate the network reliability.
     状态树搜索方法通过在一个状态树中搜索所有的有效状态来计算网络的可靠性;
短句来源
  相似匹配句对
     An Efficient Line Search Scheme
     线性搜索方法的改进
短句来源
     Methods:Part Ⅰ
     方法
短句来源
     Method:The rats received graded morphine each day intraperitanealy.
     方法
短句来源
     BE, was introduced.
     BE的加入程序及搜索方法
短句来源
     The Trees
    
短句来源
查询“树搜索方法”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  tree search method
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.
      
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.
      
The purpose of the present paper is to present a tree search method that seems to decrease this complexity drastically.
      


A new approach for game tree searching based on the ordered weighted averaging (OWA) aggregation is presented. This method can remedy the defect of some game tree searching techniques such as a pruning. And its performance is better than that of the Min/Max approximation which based on the generalized mean-valued operator.

提出了一种基于有序加权平均(Ordered Weighted Averaging—OWA)的博奕树搜索方法.该方法可以弥补α—β剪枝等方法中存在的一些缺陷,且具有比基于广义均值的Min/Max近似搜索更好的性能.

An additional term reflecting the transverse sediment transport due to secondary flow in river bends is addd to the basic equation for plane 2-D flow and sediment movement to extent the existing mathematical model. In addition, an approach based on the soil mechanics is adopted to analyze the stability of the riverbank and integrated into the extended mathematical model, so that the mathematical model is capable to simulate the deformation of river bend due to both hydraulic erosion and slope failure. For numerical...

An additional term reflecting the transverse sediment transport due to secondary flow in river bends is addd to the basic equation for plane 2-D flow and sediment movement to extent the existing mathematical model. In addition, an approach based on the soil mechanics is adopted to analyze the stability of the riverbank and integrated into the extended mathematical model, so that the mathematical model is capable to simulate the deformation of river bend due to both hydraulic erosion and slope failure. For numerical solving the governing equations for shallow water flow and sediment transport the finite volume method(FVM) and Riemann solver are applied. An example of its application is presented. It shows that this extended model is capable to simulate the generation and evolution of river bends.

本文考虑弯道环流输沙效应,在泥沙运动基本方程中增加了反映环流横向输沙附加项,对平面二维水沙数学模型的悬移质、推移质输沙方程和河床变形过程进行了扩展。借助土力学中关于边坡稳定性理论中的圆弧滑动法,并引入多杈树搜索方法,建立了适用于平面二维数学模型的河岸崩塌变形计算方法。经扩展后的平面二维水沙数学模型能模拟环流横向输沙及由其引起的河床冲淤和河岸变形,并应用该模型模拟了弯道发生、发展过程,计算结果与已有的认识是一致的。

In many games, locality exists when considering the influence of operations on game state. Basing on such locality, a new static evaluating algorithm called Δfeature evaluation is described, which substitutes global scans of game state on leaf nodes for local scans on edges in game searching tree, and which results a considerable reduction of time consumption. In case of intense locality, state scans can be replaced by table searching, leading to a faster searching speed. ΔFeature evaluation can also co-operates...

In many games, locality exists when considering the influence of operations on game state. Basing on such locality, a new static evaluating algorithm called Δfeature evaluation is described, which substitutes global scans of game state on leaf nodes for local scans on edges in game searching tree, and which results a considerable reduction of time consumption. In case of intense locality, state scans can be replaced by table searching, leading to a faster searching speed. ΔFeature evaluation can also co-operates with other game tree searching enhancements to reach an even better performance.

在考虑下棋操作对棋盘影响的局部性后,提出了棋博弈的Δfeature状态估值算法,通过计算博弈树中相邻结点的特征变化来避免在叶结点上扫描整个棋盘,有效地减少了静态估值的时间开销。若棋子影响的局部范围足够小,还可以考虑将局部范围的所有情况列成表,以查表代替棋形匹配。ΔFeature状态估值算法也可以与其它优化博弈树搜索的方法一同使用,达到更好的效果。

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

 


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

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