最優二叉樹 的英文怎麼說
中文拼音 [zuìyōuèrchāshù]
最優二叉樹
英文
huffman coding- 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
- 二 : Ⅰ數詞（一加一后所得） two Ⅱ形容詞（兩樣） different
- 叉 : 叉動詞[方言] （擋住, 卡住） block up; jam
- 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
- 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
-
In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree
特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。First, we have expatiated the working principle, performance parameters and major technologies. farther, we have analyzed the shortcomings of the existing catalog search engine and introduced the clustering analysis and the ant algorithm ; on the basis of this, we discussed the possibility and necessity of the connection between them, which avoids the local optimization of the clustering analysis to a degree. in the end, we appraise the idea that we deal with the information data by the data structure of the binary tree, m - branch tree and tree established by the ant algorithm, which can improve the efficiency of the search engine
首先闡述了搜索引擎的工作原理，性能指標，主要技術；分析了現有目錄式搜索引擎的缺點，接著介紹了聚類分析演算法與螞蟻演算法的理論，並論述了二者結合的可能性和必要性，這種結合方法也在一定程度上克服了聚類分析演算法容易陷入局部最優的缺點，最終提出了通過使用螞蟻演算法建立二叉樹、 m叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。But after the safety premium and after - tax cash flow advantage are considered, the explanation of the wealth transferring effect is enhanced. the above research does not consider the restriction of hard call requirement and soft call requirement on call behavior, and the call notice period is only analyzed with experiences. therefore, starting from the pricing model and after considering the restrictions of various convertible bonds contracts, this article proceeds to build a model based on binomial tree, calculate the value of convertible bonds using the numerical method of forward shooting grid and gain the operation principle of optimal call of corporations
上述的研究沒有考慮硬贖回要求和軟贖回要求對贖回行為的限製作用，對贖回通知期的考察也只是採取了一個經驗值來刻畫，因此本文接著從定價模型出發，在綜合考慮了各種可轉換債券合約對贖回行為的限制條款后，構建了一個基於二叉樹模型並應用向前網格射擊的數值方法來求解可轉換債券的價值，並推導出了公司的最優贖回運演算法則。
分享友人