graph coloring 中文意思是什麼

graph coloring 解釋
圖色
  • graph : n. 1. 【數學】曲線圖；坐標圖，圖表。2. 統計曲線。vt. 用圖表表示，把…繪入圖表。n. 膠版。vt. 用膠版印刷。n. 【語言學】1. 詞的拼法。2. 表示音素的最小字母單位。
  1. The coloring method to negate hamilton properties of a graph

    問題的著色否定方法
  2. In this paper, four types of graph coloring are discussed : dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs

    本文討論了若干圖類的四種不同的著色問題：動態著色、關聯著色、平面圖的完備著色和邊面著色。
  3. The complete game coloring number of the line graph of a forest

    森林線圖的完全游戲色數
  4. Then, the course of the development of register allocation strategy is illuminated in detail and a direct priority - based register allocation approach via the analysis and comparison of many improvements to the graph coloring strategy is proposed, it selects the split live range based on the priorities of the spilled live ranges not the priorities of the total candidate live ranges

    然後，詳細闡明了寄存器分配策略的演化歷程，通過分析和比較基於圖著色法的各種改進方案，從實現最優分配的角度，在chow和hennessy的寄存器分配方案的基礎上提出一種基於直接優先級的寄存器分配策略，更直接、更具體地根據溢出活躍范圍段的優先級決定切分。
  5. Based on the conclusion of organizing into trains and simulating the thoughts of dispatchers in district stations, this paper analyzes the features of time sets of shunting locomotives, constructs the reasonable graph model in the way of making out time sets, and converts it into the problem of graph coloring

    在車流推算的基礎上，從應用計算機模擬區段站調度員思維的角度出發，通過分析車列佔用調車機車時區集合的特點，使用劃分時間片的方法建立合適的調車機車安排的圖論模型，將調機運用問題轉化為頂點具有加權的圖的k -著色問題。
  6. The problem is addressed through mathematical programming approach, the linear integer formulation is developed for optimizing the network throughput, and then the similarity between the original problem and the graph edge coloring problem is shown through the conflict graph concept. a column generation solution is proposed and several enhancements are made in order to fasten its convergence. numerical results demonstrate that the theoretical limit of the throughput can be efficiently computed for networks of realistic sizes

    一個對tdma機制的有效改進方法是空分tdma機制，它將無線結點之間的物理距離考慮在內，規定互相不干擾的通訊鏈路可以在相同的時間片內傳輸，從而減少了網路所需時間片的總量，從而提高了單位時間內可傳輸數據包的數量，即提高了整個網路的吞吐量throughput 。
  7. A min - conflict weight - learning algorithm for graph coloring problem

    圖著色問題的一個最小沖突權值學習演算法
  8. By virtue of associating and improving the graph coloring algorithm and maximal matching algorithm, a coloring - matching algorithm is proposed to solve the exam - arrangement problem

    摘要將安排考試課程與分配班級考場分別化為圖的染色與最大匹配問題，進而將兩種演算法融合併改進，使之適合於實際應用。
  9. In the second part, this paper does deeply research on how to use the memory system effectively. firstly, this paper proposes a modified register allocation via graph coloring to alleviate port conflicts

    然後，面對分體寄存器文件可能產生埠沖突的新問題，提出了改進的基於圖著色的寄存器分配法。
  10. Based on the combination of graph coloring model and the concept of spectrum quality grading, the proposed algorithm allocated the available spectrum to cognitive radio cells to meet demand maximally under qos guarantee

    使用圖論著色模型，結合頻譜質量分級概念，根據小區內需求情況，該演算法將網路中周期檢測到的可用頻譜分配給各個認知小區，最大化滿足需求的同時，為業務提供服務質量保障。
  11. The concept of the relaxed game chromatic number of a graph was firstly introduced by chou, wang and zhu in [ 1 ]. it connects the coloring problem with the game theory, so it is a important subject in the graph coloring theory and is studied by many researchers

    圖的鬆弛競賽色數首先是由周，王，朱[ 1 ]提出來的，它把對策論和染色理論兩個重要問題緊密聯系在一起，從而使它在圖染色理論中佔有很重要的位置，並引起了眾多專家人士的興趣和關注。
  12. Cycle time assignment of nonlinear discrete event dynamic systems and coloring condensation graph

    的周期時間配置與凝著色圖
  13. Algorithm for graph incidence coloring base on hybrid genetic algorithm

    基於遺傳演算法的圖關聯著色演算法
  14. On the total coloring of a special double - outer planar graph

    一個特殊的雙外平面圖的全染色
分享友人
分享到 Line

分享到臉書