頂點覆蓋 的英文怎麼說

中文拼音 [dǐngdiǎnfùgě]
頂點覆蓋 英文
knotenueberdeckung vertex cover
  • 頂 : i 名詞（人體或物體的最上部） crown; peak; top Ⅱ動詞1 （用頭支承） carry on the head 2 （從下面拱...
  • 點 : Ⅰ名詞1 （液體的小滴） drop （of liquid） 2 （細小的痕跡） spot; dot; speck 3 （漢字的筆畫「、」）...
  • 覆 : 動詞1. [書面語] （蓋住） cover 2. [書面語] （底朝上翻過來; 歪倒） overturn; upset 3. 同 「復」 （Ⅱ1. 2. ）
  • 蓋 : 蓋名詞（姓氏） a surname
  • 頂點 : apex; zenith; acme; vertex; corner; tip top; pinnacle; acnode; perfoot; top; grand climax; full; ...
  • 覆蓋 : 1 （遮蓋） cover; overlap 2 （植被） plant cover; vegetation3 （保護層 覆蓋物） cover; covering; ...
  1. But the classical vertex cover algorithm can not use in the cbvc problem directly, because the cbvc problem have more term need to constraint

    但是，以上的演算法並不能直接應用於受二分圖約束的頂點覆蓋問題（ constraintbipartitevertexcover ， cbvc ）求解。
  2. Also with the help of graph rewriting, a new decision selection algorithm is proposed. this algorithm takes advantage of the weighted vertex cover algorithm, finds the vertexes with different color, and puts the minimum one into the group of chosen by sequence

    同時，利用圖重寫規則實現了一個決策選擇演算法:採用圖的最小頂點覆蓋集合的演算法，首先通過圖著色找出著色相異的頂點，依次將可以使系統效益最大化的決策點加入到決策集合中。
  3. The zenith of her frustration being a moment of total helplessness on an ice - capped new zealand mountain

    她困惱的最頂點出現在一個覆蓋著冰雪的紐西蘭山上一時的無力感。
  4. In this thesis, a polynomial function of exact cover to area minimization was given, and one case, k 3, is discussed

    本論文利用最小頂點覆蓋問題規約到面積優化問題，只需討論k 3一種情況，證明過程很簡略。
  5. The simulation results show that the novel algorithm is more scalable than the traditional algorithms, and can find smaller weak vertex cover

    模擬結果表明，比較現有演算法，新演算法能找出更小的弱頂點覆蓋集，具有更好的可擴展性。
  6. A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper, which can be used for monitor - nodes selection in net traffic measurement

    摘要提出了一種分散式求解弱頂點覆蓋集的近似演算法，用於網路流量有效測量點的選擇。
  7. But this algorithm do not guarantee the minimization of the set of vertex cover, which mean while do not guarantee it can be fixed that all of fault chips which should be fixed

    但該演算法的缺點在於不能保證求出頂點覆蓋的最優解。也就是說，當一片晶元在事實上是可修復時卻有可能在近似演算法中得到不可修復的結論。
  8. This problem was first studied by n. hasan and c. l. liu in [ 5 ], and get some useable result : this problem can be solved as a constraint bipartite vertex cover ( cbvc ) problem. hasan and liu proposed two algorithms that solves the cbvc problem

    另外， kuo和fuchs還對如何修復給出了兩個演算法：一個是近似演算法，到目前為止，該演算法仍然是最高效的頂點覆蓋問題的求解演算法之一。
  9. The utility model has the following advantages : to embed the character layer with night - light display into the groove of the top face for the key body and cover with the transparent protection surface layer, which causes the character with night - light display against the wear ; the transparent protection surface layer is embedded into the groove, which is easily fixed and causes the appearance of the key body smooth and beautiful

    本實用新型具有如下優點：將夜光顯示字元層嵌入鍵體的頂面凹槽中，並覆蓋上透明保護表層，使夜光顯示字元耐磨損，透明保護表層鑲嵌凹槽內，不但易固定，而且鍵體表面平整美觀。
分享友人
分享到 Line

分享到臉書