game tree search algorithm 博弈树搜索算法
Monte Carlo Tree Search Algorithm 蒙特•卡洛树搜索算法
Search tree algorithm 搜索树算法
multi-slot binary search tree algorithm 多时隙二进制搜索树算法
When tree search algorithm is applied to this bit-level tree structure, a bit-level tree search algorithm is obtained. The proposed bit-level tree search algorithm can be employed in the rank-deficient MIMO systems.
使用这样的上三角结构,并结合树搜索算法,可以得到比特级的树搜索算法。
参考来源 - MIMO系统中的检测算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
This paper gives profound research is game-tree search algorithm and game-tree optimization technique.
基于博弈树的构建 ，对传统的博弈算法进行了分析研究 ，指出了其存在的不足。
The algorithm is simple; it iterates through the top-level items of the tree and compares their text contents with the search string (lines 43 to 52 in listing 6).
算法很简单，它对树的顶级项目进行迭代，并将其文本内容与搜索字符串进行比较(清单6中的第43 - 52行)。
We are currently investigating whether using a customized B-Tree algorithm can make it possible to search with the help of wild CARDS and to store index documents more compactly.
我们目前正在研究使用定制的B - Tree算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
应用推荐