tree optimization 中文意思是什麼

tree optimization 解釋
樹優化
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  • optimization : n. 最佳化，最優化。
  1. 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匯編語言層次上對所有的演算法加以實現。
  2. 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叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  3. By this means, user can recover the model with arbitrary geometry and topology. during the interaction, the reconstructed results can be computed and displayed instantly because we use an optimization - tree based symbolic and numeric hybrid optimization - solving approach

    採用這種方法，系統在接受使用者的交互之後，可以實時地求解幾何參數與照相機投影矩陣，並即時地在一個三維窗口中顯示重建結果，做到真正的所見即所得。
  4. At network layer, an initialization algorithm based polling is researched to establish preliminary connections autonomously. and a genetic algorithm based optimization is used to obtain a routing tree that results in minimum energy consumption

    在網路層的初始化演算法中，研究了基於輪詢的方法來形成網路的最初連接圖，並用基於優化的遺傳演算法來獲得一棵具有最小能量消耗的路由樹。
  5. The rectilinear steiner minimal tree rsmt problem is one of the fundamental problems in physical design, especially in routing, which is known to be np - complete. this paper presents an algorithm, called aco - steiner, for rsmt construction based on ant colony optimization

    製造工藝由超深亞微米vdsm進入到納米nanometer階段，作為物理設計physical design重要階段之一的布線routing ，其演算法研究與工具設計面臨新的挑戰。
  6. Aimed at the current problem of pipeline layout optimization technique, the research of irrigation pipeline layout and pipe diameter optimization has been done, the gis ( geography information system ) and graph theory were first put forwarded to applyed to the design of low pressure pipeline irrigation project in the paper. with the support of gis, the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipeline ' s layout optimization. at the aspect of pipe diameter optimization, simplicial method and interior - point method are been used in solve liner optimization model of pipe diameter to reach minimum project cost or a nnual working cost of low pressure pipeline irrigation

    本文主要針對當前南方地區低壓管道輸水灌溉規劃設計中存在的技術難點，開發研究先進實用的樹狀低壓輸水灌溉管網計算機輔助設計系統。首次提出了將gis （地理信息系統）和圖論技術應用於低壓管道輸水灌溉規劃設計及灌溉管網優化中，在gis支持環境下，應用圖論中的最小生成樹法和120規劃進行管道的最優化布置。建立以管道輸水灌溉系統的年折算費用最小為目標函數的管徑優化線性規劃模型，並將內點法應用於線性優化模型的求解。
  7. Abstract : in this article an optimization method is applied to de sign open - type distribution networks. graph theory technology is used. its mathem at ical model considers both the investment of constructing lines and the cost of o peration. the main idea is getting the structure of tree network that meets with the technical constraint conditions and at the same time make the annual cost mi nimum. the examples of simulation show that this method is fast and effective

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  8. Aco - steiner : ant colony optimization based rectilinear steiner minimal tree algorithm

    Aco - steiner ：基於蟻群優化策略的最小直角steiner樹構造演算法
  9. Rectilinear steiner minimal tree rsmt, routing, physical design, ant colony optimization

    本文根據蟻群優化策略aco ，提出了一個rsmt的構造演算法，稱為aco - steiner 。
  10. 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和故障樹分析法以及關鍵設備預防性維修周期優化的數學模型，提出了確定維修工作類型的技術方法。
  11. With these foundation, the paper puts forward several solution schemas of key technologies in mois, such as 3 - tiers system architecture optimization, binary file compression & encryption, tree relationship data process, active notice delivery mechanism and network environment adaptability, and makes some ex ploring research about intelligent software agent and text mining technology

    在此基礎上，給出了若干mois關鍵技術的解決方案，包括三層體系結構優化方案、二進制格式文件壓縮加密方案，層次化關系數據的處理技術、主動式通知傳遞機制和網路環境適應性方案等，並對智能軟體代理和文本挖掘技術作了探索性研究。
  12. The decision tree had a lot of algorithms, this paper focus on the optimization of fast classification in the face of n - value attribute of id3 algorithm which had parameters of user ' s interest. on the basis of avoiding the weak relevant attribute of n - value covered the worth strong relevant attribute, simplify complexity of the original algorithm and code cost through the mathematics tool, thus raise the speed of operation while using this algorithm, and lower costs in thrift as much as possible, to raise the efficiency

    決策樹學習有很多演算法，本文著重研究了對引入用戶興趣度參數的id3演算法在面對多值屬性時的快速分類的優化，在避免了多值弱相關屬性覆蓋少值強相關屬性的基礎上，通過數學工具簡化原演算法的復雜度和編碼代價，從而提高使用該演算法時的運算速度，盡量多的節約計算時間，從而達到降低成本的，提高效率的目的。
  13. In addition, we summarize some spatial join algorithms based on r - tree index and their cost estimation models. we also give out a query optimization algorithm framework based on dynamic programming algorithm, and integrated basic r - tree index method and query optimization mechanism into sadbs ii

    另外，本文還總結了幾種基於r樹索引的空間連接演算法及其代價評估模型，利用動態編程演算法給出了查詢優化的演算法框架，並在sadbs中集成了基本的r樹索引方法和查詢優化機制。
  14. In this paper, we study the clock tree optimization for the tolerance of process variation

    在本篇論文中，我們研究有關于製程變異容忍度的時鐘樹最佳化方法。
  15. The second one is multicast routing algorithm based on clone selection algorithm, clone selection algorithm is a global optimization algorithm and can improve the performance of multicast tree

    第二種是基於免疫克隆選擇演算法的組播路由演算法，該演算法利用了免疫克隆選擇演算法全局搜索能力，提高組播樹的性能。
  16. Optimization of transformation for 3d reconstruction of coronary arterial tree

    冠狀動脈樹三維重建方法
  17. Main contents list as follows : 1. eai communication mechanism of vrml 2. feature based model restructure 3. mapping algorithm of model 4. assembly processing analysis 5. creating mechanism of assembly model 6. optimization of model 7. assembly constraint relations processing prototype system of web - based interactive virtual assembly platform is developed based on studies above, and its functions, such as data management of network virtual product, definition of assembly tree structure, control of assembly, etc, are implemented and have gotten well engineering application effect

    課題重點研究了該平臺的體系結構及支持網路化虛擬裝配中的相關關鍵技術，包括vrml的eai （ externalauthoringinterface ）通信機制、基於特徵的模型重構、模型的映射生成演算法、裝配過程分析、裝配模型的創建機制、模型的優化處理、裝配約束關系的處理，並在此基礎上開發了一個基於web的互動式虛擬裝配平臺的原型系統，實現了網路化虛擬產品的數據管理、裝配樹結構的定義以及裝配控制等功能，取得了較好的工程應用效果。
  18. To make it clear, the article use and analyze numerical value cases from bellmum and zadeh. finally in order to work out the value function in all forms and the expected value of optimization in all aspects easily, we take down all the problem existing in multi - stage stochastic decision processes. the solution of optimum is formed and multi - stage stochastic decision tree - table is introduced

    為說明問題，本文利用bellman和zadeh [ 1 ]的數值例，應用兩種方法進行分析，最後為了更方便的解出對所有形式的評價函數，及其期望值的最優化解對各種進行的發展，把經過多階段概率決策過程的問題記述下來，構成一個最優解的統一圖表，引入了多段概率決策樹表。
  19. For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization, a heuristic search method is proposed, in which based on minimum spanning tree, degrees of vertices over the constrained degrees are reduced to the required state

    摘要針對網路設計和優化中度約束最小生成樹問題，提出了一種基於貪心思想的啟發式演算法求解度約束最小生成樹。
  20. Topology optimization of tree - type water - injection pipe network based on hybrid genetic algorithm

    油田地面注水管網布局優化中的遺傳演算法
分享友人
分享到 Line

分享到臉書