complexity graph 中文意思是什麼

complexity graph 解釋
復雜性圖形
  • complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. In order to improve the existing methodology of carpool information retrieval, on the basis of the region to region algorithm and by the use of the graph theory, an algorithm based on traffic network and its complexity analysis were presented

    低效率的信息交流方式制約了合乘出行方式的發展，針對現有合乘信息檢索方式的不足，在區域區域匹配演算法的基礎上，引入圖的概念，提出了一個基於交通路網的路徑匹配演算法，並給出了演算法復雜度分析。
  2. A problem on the computational complexity of graph partitions

    關于圖劃分中的一個計算復雜性問題
  3. Based on knowledge reasoning, fuzzy theory, extraction of sub - assembly and cluster, and hierarchical connection relation graph, an assembly sequence generation algorithm is studied in this paper, which breaks down the original complex assembly sequence generation problem into several small scale assembly sequence planning problems to reduce the computing complexity caused by cut - set theory. a hierarchical and / or graph to store all the generated sequences is also employed for this purpose

    本文提出基於知識推理及模糊理論，結合子裝配與聚族提取以及裝配樹，利用層次聯接關系圖，將一個復雜的裝配序列求解問題轉化為若干個相關的小規模裝配序列求解問題，並用一種層次與或圖結構存儲裝配序列，使割集法求解裝配序列的計算復雜度大大降低。
  4. Traveling salesman problem is combinatorial optimization problem in graph theory, it has npc computation complexity, and lots of problem can transfer to traveling salesman problem. the computation of tsp is analyzed, then the hopfield network method for solving tsp is given, at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling

    首先分析了旅行商問題在窮舉搜索法下的工作量；其次給出了求解旅行商問題的hopfield神經網路方法，同時分析了利用人工神經網路求解旅行商問題所存在的問題；最後利用混飩神經網路模型求解10城市旅行商問題和中國旅行商問題。
  5. If we graph the relationship between environmental complexity and probability of success with a flexible methodology that incorporates controls and risk management, the tolerance for change is more durable

    如果我們畫一個關系圖，用來表示環境復雜性和的項目成功的概率之間的關系，這里的項目是指應用了統一控制和風險管理的可適應方法論的項目。
  6. Based on the timing constraints event model of rtl ( real time logic ), the compiling algorithms for timing constraints event transform the problem of how to detect timing constraints event to the problem of how to find negative cycle in weighted directed graph, which is named as constraints graph. by simplifying constraints graph, the efficient detecting algorithms for timing constraints event have been developed, which not only has good time complexity but also can find events that violate timing constraints as early as possible. in order to verify the event detecting methods based on dynamic rules and to check its efficiency in application, experiment schemes are designed and performed on the implemented prototype system in linux environment

    帶時間約束事件的編譯演算法以rtl （ realtimelogic ）事件模型為基礎，將帶時間約束事件的檢測轉化為在帶權值的有向圖（此即受限圖）中尋找負圈的問題，它通過化簡受限圖得到最小有效約束集；運行時事件檢測演算法在最小有效約束集上檢查事件的時間約束，不但有較好的執行效率，而且能盡早地發現違反時間約束的事件。
  7. This paper analyzes and develops the existing risk analysis model bases on term rewriting system. it divides the group of assets into critical and normal subset, and performs the analysis in separate procedure. this reduces the system complexity, guarantee the priority of the critical assets ; it also introduces and / or attack tree into the attack scenario, cut down the system requirement of space, and provides support for both the coming graph rewriting model and decision selection algorithm

    本文針對項重寫風險分析模型中資產的關鍵性級別，劃分出關鍵資產，通過分步的風險分析，實現不僅可以降低系統復雜度，還能有效保證關鍵資產的優先處理;引入了與或攻擊樹構建攻擊場景，節約了運行所需的空間，為后來的決策選擇打下基礎，同時也為以後的圖重寫的風險分析提供依據。
  8. Because of the np complexity of mapping problem, the thesis studies two - step method : optimal scheduling of data flow graph and optimal processor mapping

    考慮到演算法映射問題的np復雜度和求解時間的指數性增加，本文主要研究兩步規劃方法，即先進行數據流圖的最優規劃，然後進行處理器的映射。
  9. Besides those, considering the complexity of hydraulic system, the paper establishes the mathematical model by the method of power bond graph

    除此之外，考慮到液壓系統動態分析的復雜性，本文利用功率鍵合圖的方法，建立了風力機變距液壓系統部分的數學模型。
  10. To aim at the disadvantages such as no entirety of semantic information and feature editing depending on the order of feature designing, a method that feature description graph express feature model is proposed. according to the method feature modified set is established through the law of the order of feature creating so that the complexity of reconstruct is reduced and the efficiency of feature editing is improved

    同時針對傳統特徵造型系統中語義信息不完備、特徵的編輯與設計歷程相關聯等缺點，提出了用特徵描述圖表示特徵模型，根據特徵生成順序的判定準則來確定特徵的關聯修改集，減少了特徵重構的復雜性，提高了特徵編輯的效率。
  11. According to these definitions, network fault management is transferred to graph research. diffusion automated fault management algorithm ( dafma ) is proposed in this part and the correctness and time complexity of it are proved carefully

    以圖為基礎，文中提出了擴散法自動網路故障管理演算法dafma ，並對該演算法的正確性、時間復雜性做了嚴格分析與證明。
  12. This dissertation is mainly devoted to find a shortest path between two distinguished points among rectilinear obstacles under bbl mode, for both asymmetric grid graph and grid - off model. we have proposed two kinds of graphic model which allow us to reduce the spatial - temporal complexity of problem significantly

    本文我們首先就物理設計中bbl模式下典型的兩端繞障礙布線問題，提出了解決不同條件下實際問題的兩種模型，即非均勻網格和無網格的兩種模型，使問題的復雜度大大下降。
  13. This method not only specifies the structure and dynamic properties but also evaluates the performance of cryptographic protocol ( mainly time delay and software complexity ). ( 3 ) firing rules of timed petri nets and the definition and algorithm of timed reachable graph are given

    （ 3 ）給出了時延petri網的引發規則、時間可達圖定義和構造演算法，並且介紹了時延petri網的兩個基本分析方法：時間可達圖（或可覆蓋圖）和狀態方程。
分享友人
分享到 Line

分享到臉書