覆蓋問題 的英文怎麼說

中文拼音 [fùgěwèntí]
覆蓋問題 英文
covering problem
  • 覆 : 動詞1. [書面語] （蓋住） cover 2. [書面語] （底朝上翻過來; 歪倒） overturn; upset 3. 同 「復」 （Ⅱ1. 2. ）
  • 蓋 : 蓋名詞（姓氏） a surname
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 覆蓋 : 1 （遮蓋） cover; overlap 2 （植被） plant cover; vegetation3 （保護層 覆蓋物） cover; covering; ...
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. On cycle double cover problems

    雙圈覆蓋問題
  2. Randomized approximation algorithm for weighted set cover problem

    帶權集合覆蓋問題的一種隨機近似演算法
  3. 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 ）求解。
  4. Recently a covering method for feed - forward neural network design has been proposed by professor zhang ling. based on the sphere neighborhood model, this method transforms the design of neural classifiers to a geometrical covering problem

    近來張鈴教授提出了一種前饋神經網路設計的覆蓋方法，它以球面領域模型為基礎，使得神經網路的設計轉化為幾何覆蓋問題。
  5. The coverage for the robot with contact sensors has been studied in the dissertation, and the internal spiral coverage ( isc ) algorithm that is based on grids is proposed in the paper

    本文研究了基於接觸傳感器的機器人覆蓋問題，提出了基於柵格法的內螺旋覆蓋（ isc ）演算法。
  6. Operators feel that the network coverage of the service area is key to successful service rollouts

    運營商感到，網路對業務服務區域內覆蓋問題是影響網路業務開展的關鍵因素。
  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. In this disser - tation we discuss two typical problems in the combinatorial geometry mentioned in [ 12 ]. helly ' s theorem plays a very important role in combinatorial geome - try

    本文就其中兩類典型問題加以討論：一類是helly型問題和幾何橫截問題，另一類是嵌入與覆蓋問題。
  9. This paper presents a fully localized algorithm to solve the worst coverage problem first introduced by meguerdichian

    Meguerdichian最先定義了最壞覆蓋問題，並提出了基於計算幾何的集中式演算法解決該問題。
  10. After deeply understood cdma system and repeater system, this paper presents a project to solve problems of the extension and coverage of cdma network according to the features of repeater products

    本文是在深入理解cdma系統及直放站系統的基礎上，根據cdma直放站產品的特點，提出的解決cdma網路延伸和覆蓋問題的系統解決方案。
  11. Given that data users should first be voice users, the coverage issue is resolved. ii

    而數據業務用戶一般首先是語音業務用戶，網路覆蓋問題得到了解決。
  12. In this thesis, a polynomial function of exact cover to area minimization was given, and one case, k 3, is discussed

    本論文利用最小頂點覆蓋問題規約到面積優化問題，只需討論k 3一種情況，證明過程很簡略。
  13. 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還對如何修復給出了兩個演算法：一個是近似演算法，到目前為止，該演算法仍然是最高效的頂點覆蓋問題的求解演算法之一。
  14. We say that the figure f fits in the target t, or, equivalently, the target t covers the figure f, when there is a rigid motion ( an isometry of the plane ) so that ( f ) t, i. e., if t has a subset congruent to f. it might happen that a specific figure f and target t are given, and one wants to know if the figure fits in the target

    如果t含有與f全等的子集，則稱f嵌人t或t覆蓋f對任意給定的f和t ，判定f是否嵌入t這類問題稱為嵌入問題給定一集族f和一目標集t ，尋找能覆蓋住f中任一元的t的最小相似圖形這類問題稱為覆蓋問題
  15. A variation of one - dimensional bin packing problem : the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed

    摘要文章介紹一維裝箱問題的一個衍生問題：最小基數箱子覆蓋問題和它的一個啟發式演算法。
  16. The detection range of the sensors has great influence on the planning ability of the covering robot. it demands more planning ability with shorter detection - range sensors

    傳感器的探測范圍對機器人覆蓋問題的規劃能力影響很大，探測半徑越小對規劃能力要求越高。
  17. In chapter 2, some necessary notations of graph theory are introduced. this chapter mainly studies covered problem of one kind of special branch factor which consists of matching set and cycles

    第二章給出了圖的必要的基本概念，研究了圖的一類特殊的由對集和圈組成的分支因子的覆蓋問題。
  18. Combinational analysis for a class of set covering problem

    一類覆蓋問題的組合學分析
  19. In this thesis, we first introduce the methodology of combinatorial design of testing parameters and the effectiveness of pairwise testing. then we define pair - combinatorial graph ( pcg ) and case sub graph ( csg ) to analyze the pair - cover problem and indicate that to achieve a minimum test set for pairwise testing is an npc problem, but the size of such test set is in a predictable range

    本文首先介紹基於參數組合的測試設計方法和配對覆蓋測試方法的有效性，並提出配對組合圖（ pair - combinatorialgraph ， pcg ）和案例子圖（ casesubgraph ， csg ）的概念來描述配對覆蓋問題。
  20. In this paper, the discussed graphs gi ( 1 < i < 8 ) are eight graphs with six vertices and seven edges. we give an unified method to construct gi - designs, maximum packings and minimum coverings and completely solve the existence problem for these designs

    本文中，我們討論了八個六點七邊圖，並且給出了一個構作這些圖的圖設計，填充與覆蓋問題的統一方法，從而完全解決了它們的存在性問題。
分享友人
分享到 Line

分享到臉書