求最小樹演算法 的英文怎麼說

中文拼音 [qiúzuìxiǎoshùyǎnsuànfǎ]
求最小樹演算法 英文
min-tree finding algorithm
  • 求 : Ⅰ動詞1 （請求; 要求） ask; beg; request; entreat; beseech : 求人幫忙 ask sb a favour; ask a favou...
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  1. By analyzing the topology of an interconnected power system, chapter 3 of this thesis derives the spanning tree, and builds the corresponding minimal cut set. by combining the results from the graph theory with the reliability indices of the individual reparable components, the reliability indices at the load point can be obtained, and the reliability indices for the whole system are deduced

    本文的第三章從單個可修復元件的可靠性指標出發，在分析電網路的拓撲結構的基礎上，利用一定的演算法求出其對應的生成樹，根據生成樹和最小割集之間的對應關系，得到整個電網路的最小割集。
  2. Simulated results showed that the proposed algorithm is available to construct effectively and quickly, the multicast tree satisfying delay constraint and lowest link cost, with network load balance taken into account to pick out the cheaper idle route

    模擬結果表明，該演算法在考慮網路的負載均衡情況下，選擇鏈路代價較低的空閑路徑，快速、有效地構建滿足時延要求，鏈路代價最小的組播樹。
  3. 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

    文摘:將圖論優化技術應用於配電網路的優化設計，提出了一種適合於開式配電網路規劃的優化方法.所建的數學模型綜合考慮了待建線路的投資和運行費用.求解方法是以圖論中的最短路徑問題為基礎，配合以開式網路潮流演算法，並通過可行路徑的合理變換，得出滿足技術約束條件且使年計算費用取極小值的樹狀網路結構
  4. Tree construction is a commonly used approach in solving the multicast routing problem with constraints

    帶約束的多播路由演算法就是要尋求一棵滿足給定約束且費用最小的多播樹。
  5. 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

    摘要針對網路設計和優化中度約束最小生成樹問題，提出了一種基於貪心思想的啟發式演算法求解度約束最小生成樹。
  6. Then subtract these improper subtrees by fragmentactivateo algorithm, and build proper minimal active fragments set

    再由搜索活動條件片斷演算法減去不符合要求的子樹，建立滿足用戶輸入的最小活動片斷子集。
  7. On the above, to overcome the pre - maturity and low speed of search in the late phase of multicast routing algorithm based on genetic algorithm, the author gives the multi - population parallel annealing genetic multicast routing algorithm to solve the bandwidth, delay, delay jitter and packet loss constrained least - cost multicast routing problem, which combines the

    在此基礎上，將多種群并行技術和退火技術相結合，以克服現有基於遺傳演算法的組播路由演算法過早收斂和後期搜索速度較慢的缺陷，且使用樹狀編碼方法，提出求解帶寬、時延、時延抖動和分組丟失率約束的代價最小組播樹的多種群并行退火遺傳組播路由演算法。
分享友人
分享到 Line

分享到臉書