算法很简单，它对树的顶级项目进行迭代，并将其文本内容与搜索字符串进行比较(清单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.
应用推荐