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算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。
A novel Unit Tree-based Breadth First Search (UTBFS) algorithm is proposed.
提出基于单元树结构的广度优先搜索算法utbfs。
The algorithm provides the possibility of reducing the size of the search tree and running time.
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
在典型的参数算法中，有界搜索树和动态规划是常用技术。
SO algorithm USES Bucket List and Singly Threaded Ternary Tree to manage and search the terrain polygon.
SO算法利用桶表和单线索三叉树进行地形多边形的管理及各种检索工作。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
The branching factor of a regular search tree has a decisive effect on the time complexity of a search algorithm.
正则搜索树的分支因数对算法的复杂度有决定性影响。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
The previous research on B&B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed.
对B&B算法的研究集中在化简搜索树从而降低搜索复杂度上，提出了几种改进的B&B算法。
This paper proposes a breath-first search based data collection tree algorithm that taking in account size of backbone, energy of node and path. The data collection tree is maintained locally.
本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。
The new method for constructing the guide tree and the basic local alignment search tool increase the algorithm speed relative to other multiple alignment algorithms.
引导树构造方法的改进和快速局部比对算法的采用，使得算法运行速度大大高于一般算法。
But can we make it more efficient in time with a tolerable space increment? We need to analyse the algorithm and the data structure of ternary search tree.
但是我们能在可容忍的空间使用增加上，进一步提高它的时间效率吗？我们需要分析三元搜素树的算法与结构。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
At last we combine the spatial scheduling algorithm on Tree-Search with multilayer backtracking strategy, through that we can get a correctional dynamic spatial algorithm.
最后将基于树搜索的动态空间调度算法与多层回溯策略相结合，进一步得到一种修正的动态空间调度算法。
Therefore, this article applies suffix tree algorithm to the meta search engines, and designs a meta search engine systems with a clustering algorithm.
因此，本文将后缀树算法应用到元搜索引擎中，设计了一个带聚类的元搜索引擎系统。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
A new algorithm for duration of task and cost in network plan is proposed, With the application of search tree and branch and bound technique, the computation procedure is greatly reduced.
同时，在计算过程中应用分枝限界方法，可使其计算工作量大大减小。
应用推荐