您要查找的是不是：
- Search tree algorithm 搜索树算法
- The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree. 实验表明，用遗传算法所设计的对弈程序优于搜索树法。
- The gridding arithmetic of search tree of robotic path is derived. 同时,还推导了机器人路径搜索树网格算法。
- The model is a generalization of conventional binary tree algorithm. 模型是传统的二元树形算法的推广。
- Fenwick tree algorithm source code integrity, and can be used directly. (译)：域树算法源代码完整，并可以直接使用。
- Generalized Search Trees for Database Systems. 数据库普通查询树。
- For regular simple Backward Search Alg-orithm (Algorithm SB), Cs, the expected branch number of the vertices on its Backward Search Tree, is equal to the average of the average outdegree of the useful vertices on the present graph of each level. 对于常规的简单 回溯法SB，回溯树上各顶点的期望分枝数cs等于各层当前可用顶点的平均出度的 平均值。
- The incremental rules extraction is a focus problem of KDD.A novel rules extraction algorithm which is called "RDBRST" (Rule Derivation Based on Rough set and Search Tree) was proposed. 摘要基于粗糙集理论提出了一种新的规则提取算法：基于粗糙集和搜索树的规则提取算法。
- Compared with Apriori algorithm and FP-growth algorithm, Combination Tree algorithm has better efficiency. 与Apriori算法和FP-growth算法相比，该算法具有更好的效率。
- Visual SEEK system developed by Columbia university, this system construct index with binary tree algorithm and retrieval based on spatial information. 哥伦比亚大学开发的VisualSeek系统，采用了二进树算法构造索引，支持空间位置关系的查询。
- Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation. 本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。
- Based on spanning tree algorithm that is suitable to data fusion, the principle and features of Minimum Cost Spanning Tree (MCST) is analyzed. 在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
- In this paper, we put forward a region representation data structure-digital search tree(DST) and its lineal encoding (LDST). 一、引言 区城表示在图象处理、计算机图形学、景物分析中有重要的应用。
- After the discussion of traditional binary tree algorithm, one registering algorithm based on the binary exponential back-off (BEB) is proposed. 根据传统二叉树算法，提出一种基于二进制指数随机后退（BEB）算法的注册方法。
- This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and design program to use it. 本章将介绍平衡的 AVL 搜寻树，讨论它的资料结构、函式，并设计程式使用它。
- Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem. 用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。
- The new algorithm adopts the binary slotted query tree algorithm, which largely reduces both query frequency and data iteration, and also improves identification efficiency. 该算法利用二时隙的方法，使阅读器的询问次数和标签识别所需的数据流大大减少，提高了标签的识别效率。
- The minimum travel-time tree algorithm is one of the main methods to trace rays, which is based on Huygens' and Fermat's principles and can be applied to complex geological model. 摘要最小旅行时树法是目前主要射线追踪方法之一，该方法以惠更斯原理和费马原理为基础，具有适应复杂地质模型的优点，缺点是速度较慢。
- Using this algorithm, the problems, that the single tree algorithm cannot adapt to nonstationary signals and the double tree algorithm has strict binary restriction, are solved. 利用此算法进行小波包分解可以解决以往分解算法如单树算法无法进行时频分解而双树算法只能进行二叉树分解的问题。
- The Decision Tree Algorithm, especially C4.5, is an important kind of classification algorithm.However, C4.5 Algorithm has some shortcomings in accuracy. 决策树算法是分类算法中一类重要的算法，其中以C4.;5算法最为流行，但是这种算法准确率性能方面还不是很理想。
