multi-slot binary search tree algorithm 多时隙二进制搜索树算法
tree search algorithm 树检索算法
game tree search algorithm 博弈树搜索算法
Monte Carlo Tree Search Algorithm 蒙特•卡洛树搜索算法
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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.
提出基于单元树结构的广度优先搜索算法utbfs。
应用推荐