算法很简单，它对树的顶级项目进行迭代，并将其文本内容与搜索字符串进行比较(清单6中的第43- 52行)。
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).
同时，还推导了机器人路径搜索树网格算法。
The gridding arithmetic of search tree of robotic path is derived.
提出了基于四叉树分形编码的水印算法，通过在不同寻找区域中搜索最佳匹配定义域块来嵌入水印。
This paper proposes a watermarking algorithm based on quadtree fractal coding, which is to search for the optimized matched domain blocks in different regions and to embed the watermarking.
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。
The algorithm provides the possibility of reducing the size of the search tree and running time.
在典型的参数算法中，有界搜索树和动态规划是常用技术。
Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
通过将启发式策略中的定向策略与层次空间推理策略相结合，模拟树的生长，提出了一种有效路径的定向层次空间推理搜索算法。
Combining the orientation of searching the route and the strategy of spatial hierarchical reasoning, an orientated tree algorithm of efficient paths is proposed by simulating the trees growing.
使用人工智能中搜索树的方法构造了一种利用计算机求解24点游戏解的算法。
An algorithm on solving 24-point game based on AI searching tree is constructed in this paper.
本文还根据八叉树这种数据结构的特点及一评价函数，提出了一种定向搜索算法来求解布局物体的装卸路径。
According to the octree's characteristics and an evaluation function, a directional search algorithm is presented for solving loading paths of packing objects.
为了在加速编码过程的同时提高压缩比，将快速卷积算法与基于四叉树分割的邻域搜索算法相结合。
In order to raise compress ratio while accelerating encoding process, an algorithm com - bining fast convolution with quadtree partitioning based on neighbor search is adopted.
为了有效利用句法信息指导翻译过程，提出了基于贪心搜索的树-串句法统计翻译模型的正向解码算法。
In order to effectively direct the translation process by syntax information, a greedy direct decoding algorithm is proposed for the syntax-based tree-to-string statistical translation model.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
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.
本文建立了列车进路的二叉树数据结构，并对列车进路自动排定搜索算法进行了研究探讨。
The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.
然而，在这样的聚类算法，对最近在最小生成树建设邻居搜索是计算的主要来源和标准的解决方案采取的O (N - 2)的时间。
However, in such clustering algorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take o (N-2) time.
解决博弈问题的传统算法——搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
第二种是基于免疫克隆选择算法的组播路由算法，该算法利用了免疫克隆选择算法全局搜索能力，提高组播树的性能。
The second one is multicast routing algorithm based on Clone Selection algorithm, Clone Selection algorithm is a global optimization algorithm and can improve the performance of multicast tree.
摘要解决博弈问题的传统演算法搜索树法所无法克服的对搜索深度的限制。
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game.
对B&B算法的研究集中在化简搜索树从而降低搜索复杂度上，提出了几种改进的B&B算法。
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.
新算法生成的线索二叉树比传统的线索二叉树优越，从而使WBS搜索更加简单、有效。
The threaded binary tree based on the new algorithm is superior to the traditional one, and thus makes the WBS searching simpler and more effectual.
本文提出广探生长树法是表上作业法中搜索闭回路的一种快速算法。
We put forward a broad-searching-growing-tree-method that is a quicker algorithm for searching closed loop in operation-at-table-method.
通过将交通路网中路径搜索的定向式启发策略与深度优先的树搜索算法相结合，提出了一种有效路径的定向树搜索算法。
Combining the directional heuristic strategy with the tree searching algorithm of depth priority, an orientated tree algorithm of searching efficient paths is proposed.
正则搜索树的分支因数对算法的复杂度有决定性影响。
The branching factor of a regular search tree has a decisive effect on the time complexity of a search algorithm.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。
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.
最后将基于树搜索的动态空间调度算法与多层回溯策略相结合，进一步得到一种修正的动态空间调度算法。
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.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
在此基础上，提出了采用虚拟矩阵匹配搜索二叉树以确定领域式规划空间中邻接关系的方法，并描述了启发式方法和概率方法相结合的路径搜索算法。
And then associating with the virtual array elements, this article improves the algorithm and an improved space-time virtual DOA array method has been made.
该算法通过对模式树的各种操作简化了对频繁项集的搜索过程。
To make further improvement on the scalability of the algorithm, we make a further study on the pattern tree, and propose a new algorithm called FP-DFS based on the study.
该算法通过对模式树的各种操作简化了对频繁项集的搜索过程。
To make further improvement on the scalability of the algorithm, we make a further study on the pattern tree, and propose a new algorithm called FP-DFS based on the study.
应用推荐