说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 带权搜索树
1)  Weighted search tree
带权搜索树
2)  tree search algorithm
树型搜索
3)  search tree
搜索树
1.
Incremental rule-extraction algorithm based on variable precision rough set and search tree;
基于变精度粗集和搜索树的增量规则获取算法
2.
A Routing Lookup Algorithm Based on Fast Search Trees;
基于快速搜索树的路由查表算法
3.
The proposed algorithm raises the efficiency of ergodic search trees and speeds up pruning.
提出的高效算法提高了遍历搜索树的效率,加快剪枝,并通过实验验证了该算法的性能。
4)  tree-search
树形搜索
1.
For conventional Gaussian approximation(GA) detection,tree-search method is used and only part of transmit symbol combinations contributing significantly to posterior probabilities are retained,having a complexity linear with retained branches number.
MIMO系统高斯逼近算法通过采用树形搜索的办法,对符号后验概率影响大的符号序列加以保留,其算法复杂度与保留符号序列数目成线性,且与调制阶数成指数关系。
5)  tree search
树搜索
1.
The Ant-Q algorithm can effectively implement this kind of tree search,and then the optimal solution of the rectangular part optimal layout will be obtained.
使用Ant-Q算法能够有效实现这种树搜索,从而求得矩形件优化排料问题的优化解。
2.
To implement this kind of tree search using ant colony system algorithm, a number of artifical ants are distributed on the root of the AND/OR tree and communicate with one another through the phenomenon trails.
用蚁群算法实现这种树搜索,是把一定数量的蚂蚁分布在与或树的根节点,蚂蚁间通过使用信息素相互交流,完成从与或树到二叉树的选择,从而得到矩形件优化排料问题的优化解。
3.
To im-plement this kind of tree search using ant colony system algorithm,a number of artificial ants are distributed on the root of the AND/OR tree and communicate with one another through the pheromone trails which are a form of the long-term memory guiding the futu.
用ACS算法实现这种树搜索,是把一定数量的人工蚂蚁分布在与或树的根节点,人工蚂蚁间通过使用信息素相互交流,完成从与或树到二叉树的选择,从而得到矩形件优化排料问题的优化解。
6)  searching tree
搜索树
1.
An algorithm on solving 24-point game based on AI searching tree is constructed in this paper.
使用人工智能中搜索树的方法构造了一种利用计算机求解24点游戏解的算法。
2.
Shortest Path Search is one of core technologies of game based on directx,this paper analyzes the common search method:breadth_first,depth_first and heuristic_Search,finally presents the a Star algorithm using searching tree to realize a shortest path finder in big size map with complicated obstacle.
最短路径搜索是directx游戏的一项核心技术,文章分析了常用的搜索算法:宽度优先,深度优先和启发式搜索,最后剖析采用搜索树的A*算法来实现大地图与复杂地形的最短路径搜索。
3.
First, the selection principle for the fuzzy wodel s number of input variables is analyzed by making use of the searching tree.
首先 ,采用搜索树对模型输入变量的选取原则进行了分析 ;然后 ,分别采用聚类分割法与平均分割法对模糊模型结构辨识方面的各自特点进行了比较 。
补充资料:因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权
因侵害姓名权、肖像权、名誉权、荣誉权产生的索赔权:公民、法人的姓名权、名称权,名誉权、荣誉权、受到侵害的有权要求停止侵害,恢复名誉,消除影响,赔礼道歉,并可以要求赔偿损失。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条