The model is a generalization of conventional binary tree algorithm.
模型是传统的二元树形算法的推广。
The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
本文讨论一种非正则的评价函数和它的最优化的一种准则，给出在这种准则下构造按字典次序的最优二元树的一种算法。
A reliability evaluation algorithm for distribution network based on binary tree is proposed.
提出了一种基于二叉树模型的配电网可靠性评估算法。
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.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
Based on the former fact, we introduce the arithmetic coding algorithm based on binary index tree.
基于上述事实，本文引入了基于二进索引树的算术编码算法。
Through analyzing standard size's layout, this paper puts forward an algorithm of engineering drawing combination composing based on binary tree.
基于对标准幅面布局的分析，提出了一种基于二叉树的工程图组合排版算法。
Based on SPKI technology, proposing multicast distributed access control system: MDAC, as wall as, proposing a delegation certificate path (DCP) searching algorithm based on binary tree.
基于SPKI技术提出了组播分布式访问控制系统MDAC，并提出了基于二叉授权委托树的委托证书路径(DCP)查找算法。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
Produce an algorithm based on encoding binary tree and supporting vector multi-category classification algorithm.
给出了一种基于编码二叉树的支持向量的多类分类算法。
Design an algorithm to serialize and deserialize a binary tree.
设计一个算法序列化、反序列化一棵二叉树。
Huffman algorithm we use to establish a Huffman tree (the optimal binary tree), while the frequency of the data as the weights assigned to Huffman tree nodes.
我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
This algorithm is totally different from previous huffman algorithm in the operation process of optimizing binary tree.
该算法在使二叉树达到最优的运算过程中，完全区别于以往的哈夫曼算法。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
The algorithm stores data by binary tree to decrease the time that accessing database.
算法用二叉树存储数据，减少对数据库的访问次数。
Then a model based on virtual binary key tree is put forward and the construction algorithm is given.
从而提出了基于虚拟二叉键树的分布式索引模型及其构建算法。
At last, a binary decision tree could be built. Algorithm analysis and simulation results show that RMBRDM can support rules with ranges and the performance of RMBRDM is better than that of PTS.
最后建立一棵二叉决策树。理论分析和仿真实验均表明，RMBRDM算法不仅支持以范围形式表示的规则，且时空性能优于PTS算法。
For this multi-label collisions problem, this paper focuses on describing two kinds of main label anti-collision algorithm based on TDMA, ALOHA algorithm and binary tree.
针对多标签的碰撞问题，本文重点介绍和讨论基于TDMA的两类主流的标签防碰撞算法：基于ALOHA的标签防碰撞算法和基于二进制树的标签防碰撞算法。
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.
新算法生成的线索二叉树比传统的线索二叉树优越，从而使WBS搜索更加简单、有效。
This paper is devoted to a study of an algorithm of generating the binary-sort-tree on the new structure and, on the basis of this algorithm, an analysis is made of the time complexity.
研究了基于一种新二叉树结构的二叉排序树的生成算法，并在此算法的基础上进行时间复杂度分析。
Finally, the experiment process is introduced, comparing with the binary decision tree based on minimum entropy heuristic information, the results show the algorithm proposed in this paper is valid.
最后，给出了实验过程，与用熵作启发式的二叉决策树的比较结果表明了本文算法的有效性。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
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)。
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)。
应用推荐