In this paper it has been proved by the optimal tree construction of graph theory that Huffman's code is an optimal method of coding with minimum redundancy.
本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。
To deal with 3-dimension variant design for complicated product, an optimal tree-structure for the parameters transfer was proposed for complicated product variant design.
针对基于3维模型的复杂产品变型，提出了与产品建模结构相融合的树形参数传递结构。
This paper proposes the concept of sensitivity of a mine ventilation network. The selective method of finding the optimal tree once for all is devised by the analysis of it.
本文提出矿井通风网络灵敏度的概念，通过对矿井通风网络灵敏度的分析，得到最优树的一次性选择方法。
Bright lights on the Christmas tree, that was, I pray you peace life optimal Yang on the night of Christmas bell, that is my wish you a happy life.
圣诞树上耀眼的彩灯，那是我祈祷你平安一生，圣诞夜里优扬的钟声，那是我祝福你快乐一生。
Up to now, the decision tree method is used to find the optimal solution of a Bayesian decision problem, that is, to select an optimal one from several decision alternatives.
决策树方法一直被用于贝叶斯决策问题的最优方案选择，即从若干决策方案中选择一个最优方案。
The protocol can search multiple feasible tree branches, and select the optimal or near optimal branch for connecting the new receiver to the multicast tree if it exists.
该协议可搜索多条可行树枝，并能选择一条最优(或近优)树枝将新成员连接到多播树。
The strategy which combines relaxation and constrained tree-searching is employed to obtain the optimal matching result.
本文采用松驰迭代与约束树搜索相结合的策略，获取优化的匹配结果。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
The problems of optimal test point selection and optimal diagnosis tree generation are discussed in this paper.
文中讨论了基于相关性矩阵的测试点优化方法和故障诊断树的生成方法。
In this algorithm, dynamic programming is used to calculate optimal local cosine tree during the LCT for signals, and the optimal entropy code is gained by the best partition of time axes.
算法对信号进行局部余弦变换时采用动态规划算法计算最佳局部余弦树，通过获得信号在时间轴上的最佳划分来获得信号的最优嫡编码。
It is difficult to use the decision tree method to find the sub-optimal solution, not to mention the alternative ranking.
利用传统的决策树方法，无法确定一个次优方案，对所有方案进行排序也很难。
The paper discusses a nonregular cost function and its optimum criterion, presenting an algorithm of constructing and optimal alphabetic binary tree under this criterion.
本文讨论一种非正则的评价函数和它的最优化的一种准则，给出在这种准则下构造按字典次序的最优二元树的一种算法。
Optimal layout to the tree water-pipe network belongs to typical combination optimal problem.
配水树状管网优化布置属于典型的组合优化问题。
This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
本文针对前缀路由查询，根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
Fault Tree Analysis Method is applied to analyze typical accidents on bridge tramway in order to develop theoretical base for finding out potential risks and stipulating optimal control measures.
分析了桥式起重机典型事故发生机理，运用事故树分析法对桥式起重机事故发生进行了分析，从而为能够找出安全隐患，制定出最优的控制措施提供了理论上的依据。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the application of algorithm in the network of road.
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
However, in most cases, the tree constructed by greedy algorithm is not optimal globally.
然而，在大多数情况下，贪婪算法构造的树不是全局最优的。
They are usable to the cases of both continuous and discrete optimal fitting problems to a given family tree.
它适用于离散和连续的谱系树的最优拟合问题。
The existing majority of the decision tree inductions are based on a top-down greedy algorithm, which make a locally optimal decision at each node.
目前存在的决策树归纳算法大多数是基于自顶向下的贪婪算法，它在每个结点都执行一个局部最优决策。
The optimal B-tree is very important data structure, it is broadly applied in the fields of communicating and engineering, and so on.
最优二叉树是一种十分重要的数据结构，在通信、工程及软件开发等领域有着广泛的应用。
Decision tree is an important tool for data mining. However, the design of optimal decision tree is proved to be a NPcomplete problem.
决策树是一种重要的数据挖掘工具，但构造最优决策树是一个NP -完全问题。
Due to the data access skew, index technology based on data access probability is proposed. At last ord algorithm is proposed to create optimal broadcast sequence according to given index tree.
针对数据库中数据访问的倾斜性，文章提出建立基于数据访问概率的索引技术，并给出了ORD算法，它可以根据给定的索引树创建最优的广播序列。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the …
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node.
在极大极小树搜索时，我们经常寻找的是根节点的最优分支。
We can use dynamic programming on the tree decomposition to find an optimal solution in linear time.
我们可以使用树分解的动态规划在线性时间内找到最优解。
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.
我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
It is proved that the problem of constructing an optimal Eectilinear Steiner Tree (RST) is NP-complete.
构造最优化的直角斯坦纳树(rst)是一个NP完全问题。
Due to the NP hard problem, it is not realistic to find the optimal decision tree. So researching kinds of heuristic algorithms to induce a decision tree with high accuracy becomes a focus.
由于NP困难，寻找最优的决策树是不现实的，从而探索各种启发式算法去产生一个高精度的决策树变成了这类研究的焦点。
Due to the NP hard problem, it is not realistic to find the optimal decision tree. So researching kinds of heuristic algorithms to induce a decision tree with high accuracy becomes a focus.
由于NP困难，寻找最优的决策树是不现实的，从而探索各种启发式算法去产生一个高精度的决策树变成了这类研究的焦点。
应用推荐