algorithm on graph theory 中文意思是什麼
algorithm on graph theory
解釋
圖論演算法-
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
低效率的信息交流方式制約了合乘出行方式的發展，針對現有合乘信息檢索方式的不足，在區域區域匹配演算法的基礎上，引入圖的概念，提出了一個基於交通路網的路徑匹配演算法，並給出了演算法復雜度分析。 -
Algorithm analysis and simulation for frequency allocation based on graph theory
基於圖論的頻率規劃演算法分析與模擬 -
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
本文提出基於知識推理及模糊理論，結合子裝配與聚族提取以及裝配樹，利用層次聯接關系圖，將一個復雜的裝配序列求解問題轉化為若干個相關的小規模裝配序列求解問題，並用一種層次與或圖結構存儲裝配序列，使割集法求解裝配序列的計算復雜度大大降低。 -
Combined with the practical situiation in distribution network, it ' s suitable to select graph algorithm as the theoretical algorithm base. based on structure variable dissipated network theory, this thesis detailedly discusses the transforms of base - to - shape, shape - to - base, vertex - to - arc, arc - to - vertex, over - heated arc dectection, load allotting, load balancing and optimum restoration
本論文基於變結構耗散網路理論，詳細討論了基形變換、形基變換、點弧變換、弧點變換、過熱弧搜尋、負荷分配、負荷均衡化以及優化恢復非故障停電區域供電等一系列與饋線自動化功能相關的處理演算法。 -
Graph theory, finite group acting on sets, orbit and equivalent relation are used to discuss the layout structure of networks for heat exchange, and a feasible optimization algorithm is given
應用圖論、有限群對集合的作用、軌道與等價關系等刻劃了換熱網路布局結構，並給出了可行的優化演算法。 -
In this thesis, we studied the basic theory of constructing isoline and the corresponding algorithm. based on object oriented technology, we implemented computer aided auto drawing of thrust isoline graph
本文的目的就是通過探討等值線構造的實現原理和相應的演算法技巧，使用目前流行的面向對象程序設計技術，在計算機上實現逆斷層地質等值線圖的自動繪制。 -
To completely avoid producing elements jointed at their corner nodes and checkerboard patterns, which frequently occur when the topology optimization of plane continuum is studied, the theory of topology analysis of plane continuum in topology optimization process and the simple algorithm for programming are studied. according to algebraic topology theory, the boundary of elements and plane continuum are operated as a one - dimensional complex. by use of the adjacency vector in graph theory, the structural topology is described and the topological operation is achieved on a computer. by above, the structural topological feature in the evolutionary process is gained. these methods are effcient and reliable. under topology constraints, according to the results of stress analysis, by deleting elements and moving nodes at the boundary, more satisfactory results can be gained by using a few numbers of elements and iterations. to demonstrate the efficiency of these methods, solutions including some well - known classical problems are presented
避免目前平面連續體結構拓撲優化過程中經常出現的單元鉸接以及「棋盤格」等現象，研究了連續體結構拓撲優化過程的拓撲分析方法，以及在計算機上實現的簡便演算法.根據代數拓撲理論，單元及連續體的邊界作為1 -復形進行運算.利用圖論中的鄰接向量概念，在計算機上實現了結構的拓撲描述及拓撲運算，得到了結構在拓撲演化過程中的拓撲特性，方法簡單、可靠.在一定的拓撲約束下，根據應力分析結果，採用刪除單元、單元退化、移動節點等方法，可以用較少單元得到更為滿意的結果，提高計算效率.為演示方法的有效性，給出幾個包括常見經典問題的解答 -
As an example, the parallel machine scheduling problem is mapped on a non - constrained matrix construction graph, and a aco algorithm is proposed to solve the parallel machine scheduling problem. comparison with other best - performing algorithm, the algorithm we proposed is very effective. the finite deterministic markov decision process corresponding to the solution construction procedure of aco algorithm is illustrated in the terminology of reinforcement learning ( rl ) theory
本章最後提出了解決并行機調度問題的蟻群演算法，該演算法把并行機調度問題映射為無約束矩陣解構造圖，並在演算法的信息素更新過程中應用了無約束矩陣解構造圖的局部歸一化螞蟻種子信息素更新規則，與其他幾個高性能演算法的模擬對比試驗證明這種方法是非常有效的。 -
( 3 ) on the basis of the dimensioning principle of correctness, integrality, clearness and rationality, utilizing the modified spanning tree algorithm in graph theory to ascertain the non - functional dimensions, accomplish the dimensioning mode analysis of the part
（ 3 ）根據尺寸標注所要求的正確性、完整性、清晰性及合理性等原則，用改進了的圖論中的生成樹演算法，確定出零件的非功能尺寸，完成零件尺寸標注模式的分析。 -
A new distributed algorithm based on graph theory optimizing model and the throughput analysis for self - organizing radio communication network
基於圖論優化模型的自組織網路演算法與網路吞吐率分析 -
3 ) presentation and implementation of key - based relational schema reverse reconstruction algorithm ( krr ). based on discrete mathematics theory, a krr algorithm is proposed which can realize the transformation from relational schema to directed graph structure and get a good data preparation for the sequential schema mapping
3 ）提出基於key的關系模式重構演算法以離散數學理論為基礎，對關系模式數學建模，通過提出基於key的關系模式重構演算法，將關系模式轉化為有向圖數據結構，為模式映射提供基礎。 -
Abstract : a new algorithm of area filling of geometry graph has been proposed. in this algonthm based on the area calculating theory of closed graph with curvilinear integral. the redundant judgement of inner pixels in the area has been eliminated and the defect of polygon area filling algorithm, which has some limitations to the graph shape, has also been overcome
文摘:基於曲線積分求封閉圖形區域面積的基本原理，提出了一種新的幾何圖形區域填充演算法.該演算法不需要對區域內點進行重復判斷，也克服了多邊形填充演算法對區域形狀有一定要求的缺點 -
The background and research situation of ldpc codes are presented and the current research results are introduced in the first part of the thesis. graph presentation and sum - product algorithm are interpreted in detail. linear coding theory and efficient constructing methods on ldpc codes are systemically interpreted later
系統地闡述了ldpc碼的圖模型表示方法及基於圖模型的譯碼原理；詳細地介紹了ldpc碼的構造方法及其線性編碼理論；介紹了用於ldpc碼閾值分析和度序列設計的密度進化理論； 2 -
Algorithm on graph theory
圖論演算法
分享友人