最大流問題 的英文怎麼說

中文拼音 [zuìdàliúwèntí]
最大流問題 英文
maximum flow problem
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 流 : Ⅰ動1 （液體移動; 流動） flow 2 （移動不定） drift; move; wander 3 （流傳; 傳播） spread 4 （向壞...
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. By using network flow theory, the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max - flow mm - cut algorithm

    利用網路流理論，將節約電量的最優化問題轉化為一個流網路的最優分割問題，而後者可採用最大流最小切割演算法實現最優切分。
  2. The retrospective algorithm about searching augmenting path of maximum feasible flow problem

    最大可行流問題中增值鏈的一種回溯求解演算法
  3. Financing service the solution enterprise the investment fund which meets in thedevelopment is short, the floating capital insufficiency, the projectfund does not arrive, lacks question and so on financing channel ; theenterprise capital will transport when does gives rise to a questionor problem, the enterprise expands the plate and the fund becomes thebiggest difficult problem

    解決企業在發展中遇到的投資資金短缺、流動資金不足、項目資金不到位、缺少融資渠道等問題；企業資本運做發生問題時，企業的擴盤和資金將成為最大的難題。
  4. Maximum flow problem

    最大流量問題
  5. This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem, the maximum flow problem, the minimum cost flow problem, and the multi - commodity flow problem

    這個主題將審視一些網流的應用並集中焦點在以下網流問題的關鍵特殊情況:最短路徑問題，最大流量問題，最少成本流量問題，和多元物品流量問題。
  6. The area is southwest of a tutt cell with weak eastward outflow and moderate equatorward outflow

    94w最大的問題也就是高空輻散不夠強了，和處于tutt （熱帶對流層上部槽）的西南側有關。
  7. Concretely we discuss the application of the shortest path problem, traveling salesman problerm and project management method on the touring itinerary improvement of travel agency. furthermore, we explore the use of minimum spanning tree problem, overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots. and also enclosed detailed spreadsheet solutions

    具體的，討論了最短路問題、旅行商問題和排程問題在旅行社線路優化中的應用；討論了最小支撐樹問題、覆蓋問題和最大流問題在旅遊景區線路優化中的運用，並在附錄中給出了詳細的電子表格解法。
  8. The dissertation summarizes the situation of some research on making profit of commercial bank treasury maximized and analyzes the reason that the profit of commercial bank treasury is so low. with following the three basic principles, namely profitability principle, safety principle and liquidity principle, the dissertation focus on analyzing the basic models of commercial bank management which are income model, safety model and liquidity risk model. meanwhile, one of the two decision models of commercial bank is taken in good consideration and it designs a model according to the two decision models. in the end, a profit maximization model of commercial bank treasury is proposed and the research achieves the aim of maximizing commercial bank profit when assuring the necessary liquidity and safety of commercial bank benefit

    論文對國內外關于商業銀行資金收益最大化問題的研究狀況進行了綜述，就商業銀行收益不高的原因進行了剖析，且在遵循商業銀行經營的三大基本原則，即效益性原則、安全性原則和流動性原則的前提下，深入淺出的分析了商業銀行經營的基本模型，即收入模型、安全模型和流動風險模型，再結合我國商業銀行的兩種決策模式，著重對其中一種模式進行分析和設計，最後建成一種商業銀行資金收益最大化模型，從而實現了保證銀行資金必要的流動性和安全性的的同時使得銀行資金收益最大化的目標。
  9. The maximum flow problem with fuzzy constraints

    帶模糊約束的最大流問題
  10. An algorithm for the solution to the maximum - flow problem of networks

    一種求解網路最大流問題的演算法
  11. Research on the typical algorithms for the maximum - flow problem of networks

    網路最大流問題典型組合演算法研究
  12. An algorithm for solving the problem of maximum flow in the transportation network

    求解網路最大流問題的一個演算法
  13. Maximum - flow problem of networks and algorithms of typical flow decomposition barrier

    網路最大流問題和典型阻塞流演算法研究
  14. Summaries are made concerning the typical network optimization problem. the paper independently puts forward several optimal methods to improve network traffic transmission, such as the maximum - flow problem over mpls, including the arc - based and path - based solution, which adopt the method of splitting and unsplitting traffic, the solution to the greatest reliability of transmission, the solution to concurrent maximum - flow for load balance via linear programming. on the basis of mpls path protection several protection methods over mpls are proposed, including n - to - 1, n - to - m protection solution in splitting and unsplitting cases and in diffserv cases, whose partial simulation results are provided as well

    即： 1 ） mpls網路最大流傳輸問題，包括基於弧的最大流解決方案、基於路徑的最大流解決方案，分流與不分流的最大流處理方法以及多源多匯最大流解決方案； 2 ）最大可靠性傳輸問摘要博士論文題: 3 ）基於弧的求解流量負載平衡問題的線性規劃方法; 4 ）基於路徑的流量負載平衡方法以及其他負載均衡問題; 5 ）在mpls路徑保護的思想和方法的基礎上，提出了基於mpls的若干新的路徑保護方法，即n一t 。
  15. Maximum concurrent flow problem with budget constraint

    有預算限制的最大并行流問題
  16. Maximum multicommodity flow problem with budget constraint

    有預算限制的最大多種物資流問題
  17. Therefore, the paper establishes the parallel computing platform and meets the demand of computing resources for large eddy simulation. it also studies the integration of cad / cam, grid generation system and cfd system, and brings the model computed in the paper into this system. on the bases of systematical and thorough numerical simulation researches in circular cylinder and the compares between instantaneous piv metrical results and numerical results of circular cylinder, the paper obtained some problems and several conclusions which should be noticed in les for making correct computatioa finally, by using these experiences and conclusions above and by putting them into an actual problem in engineering - optimized numerical simulation of static mixer, this paper achieved the turbulent high - level numerical simulation technique, i. e., system atical attempt in engineering application by les method

    為此，搭建了微機并行計算平臺，解決了大渦模擬對計算資源要求；對cad cam 、網格生成與cfd系統集成進行研究，並將論文中所要計算的模型納入到此系統內；在對圓柱繞流問題進行了系統和深入的數值模擬研究和對圓柱繞流瞬態piv測量結果與數值計算結果進行比較工作基礎上，得到大渦模擬方法正確計算所需要注意問題和若干結論；最後利用以上得出的計算經驗和結論，通過對一個實際工程問題? ?靜態混合器優化的數值計算，完成了cfd中湍流高級數值模擬技術? ?大渦模擬方法工程應用的系統嘗試。
  18. In the conclusion section, we point out the results and improvement we have made and further research work we need to do

    將網路需求分佈與網路最大流問題相結合，提出了基於固定需求格局之下的網路最大流問題。
  19. First, suppose a source point and a sink point. second, draw a unilateral line from source point to every substation node. the line ' s capacity is set as corresponding substation ' s allowable load value and the line cost is set as the substation ' s unit load cost

    本文通過線性化處理后將網架優化模型描述為一個最小費用最大流問題，虛擬一個源點和一個匯點，從源點到各變電站節點各引一條單向弧，弧容量為變電站允許的負荷值，弧費用為變電站單位負荷的費用。
  20. Then after introducing the grammar rule of lk _ yy language, we introduce the data structure and algorithm to implement them in details. among them, we first introduce the realization of basic language, then put emphasis on the translation of simple model object and the implementation of the two other basic features, inheritance and method overriding. last, making use of lk _ yy, we solve the maximum cost minimum flow problem in traffic program of gis

    首先指出了lk _ yy解釋系統是採用面向對象的系統分析與設計方法來實現的；然後在介紹lk _ yy語言語法規則的基礎上詳細介紹了實現它所需的數據結構和演算法描述，其中先介紹lk _ yy語言中基本語言的實現，然後重點講述了簡單模型對象的翻譯以及對象的兩個基本特徵繼承性和方法覆蓋的實現；最後利用lk _ yy解決了實際gis系統中交通規劃的最小費用最大流問題。
分享友人
分享到 Line

分享到臉書