optimal tree 中文意思是什麼

optimal tree 解釋
最優樹
  • optimal : adj. 最適宜的；最理想的；最好的 （opp. pessimal）。
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. Then, the associated search optimal algorithm based on virtual avl tree is promoted to rapidly reconstruct the half - edge topological structure. 3. to rebuild the tooth surface from the littery measure data, the membrane deformation algorithm based on loop subdivision is given to fit density triangle meshes to subdivision surface

    前者巧妙、高效地完成了去除冗餘點的工作，將stl數據的存儲尺寸壓縮為原來的18 % 25 % ;後者完成了數據的半邊拓撲重建，使得后續對于邊界邊搜索、 1環鄰域搜索顯示出較好的優勢，實現了三角網格模型的快速拓撲重建。
  2. An approximation algorithm for min - max tree partitioning and an optimal algorithm for min - sum tree partitioning

    最小最大樹劃分的近似演算法與最小和樹劃分的精確演算法
  3. Constructing an evolutionary tree is a typical np - complete problem, therefore it is of great significance to construct an algorithm capable of getting optimal approximate solutions

    發生樹的構建問題是一個np完全問題，因此，研究構造發生樹的近似最優演算法有著重要意義。
  4. Completion time of the collective communication operation is optimal in the grid environment. in this paper, we gave an example about broadcast, analyzed and compared a topology - unaware broadcast algorithm ( e. g. a binomial tree broadcast ), a two - level topology - aware broadcast ( e. g

    在這篇論文中，我們以廣播通信為例，分析比較了未知拓撲型的廣播演算法，兩層的已知拓撲型廣播演算法（例如ma吵人以及多層的已知拓撲型廣播演算法（例如mh0十02l並重點研究了網格環境下的多層已知拓撲型廣播演算法。
  5. Because the guide tree is not near - optimal, an improved neighbor - joining was designed that its idea is to look for a leading taxon. 7

    針對其在指導樹生成方面存在近似程度不高的問題，運用尋找主結點的思想，設計了neighbor - ioining的改進演算法。
  6. In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node

    在極大極小樹搜索時，我們經常尋找的是根節點的最優分支。
  7. As the determination of such optimal multicast routes was computationally intractable in polynomial time, a multicast routing algorithm based on genetic algorithm was proposed to simultaneously optimize different parameter, in which multiple multicast tree route solutions were generated

    由於多播路由的最優選擇問題在多項式時間內難以求解，提出一種使用遺傳演算法的路由演算法來同時優化不同的服務質量指標，計算產生出幾種路由樹。
  8. By computing the cost of the cheapest subtree with size constraints of the partial tree ( this is an upper bound on the cost of the final optimal tree ) and lower bounds on the cost of subtrees of varying sizes that are rooted at nodes of the partial tree, the algorithms can identify and prune nodes that cannot possibly belong to the optimal constrainted subtree

    建樹階段設置大小限制的修剪演算法是通過計算出不完整樹的最小代價得到優化樹的代價上限，根據此上限以及計算出的節點的實際代價來修剪節點的。在預測模型中應用了在建樹階段加入大小限制條件的修剪演算法。
  9. 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

    上述的研究沒有考慮硬贖回要求和軟贖回要求對贖回行為的限製作用，對贖回通知期的考察也只是採取了一個經驗值來刻畫，因此本文接著從定價模型出發，在綜合考慮了各種可轉換債券合約對贖回行為的限制條款后，構建了一個基於二叉樹模型並應用向前網格射擊的數值方法來求解可轉換債券的價值，並推導出了公司的最優贖回運演算法則。
  10. A new heuristic search method is devised for maximum likelihood method, which first constructs a starting tree, and then through branch swapping searches for trees best resembling the present optimal tree and locates a better tree. repeat this process, till no more better trees are generated or the upper iteration limit is arrived and the program ends

    對最大似然法，改進了一種新的啟發式搜索:隨機建立一棵初始樹，然後通過查看與當前最優樹拓撲最近的樹，從中尋找更優樹，不斷地更新當前最優樹，直到無法找到更優樹或者達到了搜索次數的上限，演算法停止。
  11. After analyzing the performance of the coherent tree - structured optimal joint detection ( tsojd ) for qpsk signals and deriving a non - coherent multi - user weight / phase estimator, the dissertation proposes a low complexity non - coherent multi - user weight / phase optimal joint detection algorithm. besides, the dissertation proposes a partial coherent multi - user / iv weight / phase optimal joint detection algorithm and some useful conclusions are obtained in comparison experiments. 4. in the research on the diversity techniques for fast fading multi - path channels, the dissertation proposes a time - scale rake receiver, and analyzes its performance with the conception of auto - wavelet - transform ( awt ) and time - - scale resolution

    提出了過飽和低復雜度qpsk信號的樹型最佳聯合檢測演算法，並分析了相應最佳接收機的性能及相位偏差對性能的影響等問題；考慮了載波相位和多用戶信碼的聯合檢測問題，通過理論推導給出了過飽和多址系統中多用戶信碼/相位聯合估計子，提出了低復雜度非相干多用戶信碼/相位最佳聯合檢測演算法，並分析了此非相干最佳接收機的誤碼性能及相位提取誤差等有關問題；提出了部分相干多用戶信碼/相位最佳聯合檢測演算法，通過計算機模擬分析了該接收機的誤碼性能及相位提取誤差等有關問題，並與相干、非相干解調兩種情況作了比較，得出了一些有益的結論。
  12. The directing thought on maintenance management based on rcm is analyzed. the femeca and fault tree analyzing methods on the purpose of optimal maintenance and the mathematical model of period optimization for preventive maintenance of critical equipment are researched. the technical method for determining the type of maintenance work is put forward

    分析了基於rcm的維修管理指導思想，研究了以優化維修為目的的fmeca和故障樹分析法以及關鍵設備預防性維修周期優化的數學模型，提出了確定維修工作類型的技術方法。
  13. These algorithms lead to optimal join performance : nodes that do not participate in the join can be judged beforehand and then skipped using b - tree index. besides, each element list joined is scanned sequentially once at most. furthermore, output of join results is sorted in document order

    其次，提出了兩個高效的兄弟關系的結構連接演算法，這兩個演算法具有較好的連接性能：不參與連接的結點可以事先判斷出來並利用b樹跳過，連接的兩個列表最多都只需掃描一次，而且連結結果按照文檔序有序。
  14. So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm

    本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
  15. Calculation of optimal angiographic viewing angles for the segment of interest from coronary arterial tree

    冠脈樹中感興趣血管段最佳造影角度的計算
  16. Optimal angiographic viewing angles for quantitative coronary angiography of the segment of interest from coronary arterial tree

    冠脈樹中感興趣血管段最佳造影角度下的定量分析
  17. Because building optimal fuzzy decision tree is np - hard, it is necessary to study the heuristics

    由於構建最優的模糊決策樹是np - hard ，因此，針對啟發式演算法的研究是非常必要的。
  18. An optimal directed connection problem in tree networks

    樹網路上的最優有向連接問題
  19. It is sometimes acceptable if one branch with a score near to the optimal one is found, especially when the depth of the tree is very large and the branching factor is big, like in go, as it is often too difficult to find the optimal branch within short time

    但當找到一個分支的值接近最佳時，有時是可以接受的，尤其是當樹的深度是很大和分支因子是大的情況下，例如圍棋，因為在短時間內往往很難找到最佳分支。
  20. By analyzing expression between a and fuzzy entropy from the view of analytics, this paper analyses the relationship of between a and fuzzy entropy and the changing trend of fuzzy entropy function with the increase of a, then discusses the sensitivity of the parameter a to classification result such as total nodes, rule number, classification accuracy of fuzzy decision tree, proposes an experimental method of obtaining optimal a, it is proved by experiment that the optimal value a obtained by this method can make the classification result of fuzzy decision tree best, and therefore provides the academic evidence of selecting parameter a in order to gain the best classification result

    本文在visualc + +軟體開發平臺及模糊id3演算法的基礎上，從解析的角度出發，通過分析參數與模糊熵之間的函數關系式，討論了隨著的增加，模糊熵函數的變化趨勢，進一步分析了參數對模糊決策樹的分類結果在訓練準確率、測試準確率、規則數等方面所表現出的敏感性，探討了得到最優參數的實驗方法。實驗證明，利用這一方法得到的最優參數的值，可以使模糊決策樹的分類結果達到最好的效果，從而為人們用模糊決策樹進行分類時選取參數以獲得最優的分類結果，提供了良好的理論依據。
分享友人
分享到 Line

分享到臉書