set covering的意思

set covering中文翻譯：

集合覆蓋

[數]集覆蓋

相似詞語短語

covering───n.遮蓋物，覆蓋層；v.遮蓋，覆蓋（cover的現在分詞）

covering up───掩蓋，蓋住

covering with───覆蓋

covering l───覆蓋l

floor covering───樓面料；地板；樓面覆面層

cusp covering───尖覆蓋

body covering───身體外層

set───adj.安排好的，固定的；位于......的；以……為背景的；頑固的，固執的；套（餐）；有可能的；做好準備的；呆板的，不自然的；n.（物品的）一套，一組，一副；一伙（或一幫）人，團伙，階層；電視機，收音機；布置，場景，舞臺；（網球、排球比賽等的）盤，局；（數學中的）集，集合；一組歌曲（樂曲）；（能力相當的）一批學生；（尤指堅定的）姿勢，神情；做頭發；凝固，凝結；獸穴；（供移植的）秧苗，插枝；裝置；n.(Set)（瑞、以）塞特（人名）；v.放，置，使處于；使開始；（故事、電影等）以......為背景；樹立，創立，確立；設置，安排；擺放餐具；鑲嵌；布置，分配，指派；凝固，凝結；使現出堅定的表情；固定發型；把（斷骨）復位；排版；為……譜曲；（日、月）落沉；結果；點燃

cuspid covering crossword───尖頂填字游戲

雙語使用場景

Listing 7. glpsol report for the set covering problem.───清單7 . glpsol對集合覆蓋問題的報告。

The set covering problem teaches binary decision variables; that is, they can only be 0 or 1, yes or no.───集合覆蓋問題涉及的是二元決策變量；也就是說，它們的值只能是0或1、yes或no。

Set covering (basketball) problem───集合覆蓋（籃球）問題

The optimization quality and computation time of set covering arid tabu search algorithms were analyzed and compared.───分析和比較了集合覆蓋和禁忌搜索兩種高效布局算法的優化性能和計算時間。

first proposed token-based set covering the practical application of the highway road network bandwidth monitoring model.───首先提出了基于標記覆蓋集的公路路網實際應用帶寬監測模型。

In this paper, the above approach is improved by introducing evaluation matrix and using the idea of approximate set-covering algorithm.───本文引入評價矩陣的概念，并使用近似集合覆蓋算法的思想，對上述模糊規則歸納方法做了改進。

Then discusses the attributes reduction based on Rough Set theory and set covering problem to combine them.───然后簡單探討了粗糙集理論的屬性約簡和集合覆蓋問題，從而將二者聯系起來。

The CGBC set covering the entire industry, nine in all areas of the forum.───此次CGBC設置了涵蓋整個產業各領域的九大論壇。

英語使用場景

A logical tool refers to a certain class of demanded cutting tools in numerical control (NC) program and can be obtained using a method for set covering problem.

In order to resolve the minimal set covering problem availably, the sticker model of DNA computation based on sticking operations is introduced.

The set covering problem teaches binary decision variables; that is, they can only be 0 or 1, yes or no.

The minimum set covering problem is an important NP - hard problem on hyper graphs.

Then discusses the attributes reduction based on Rough Set theory and set covering problem to combine them.

With the aid of sticker model, the minimal set covering problem can be solved by transforming the subset to memory complex and utilizing the massive parallelism of sticking operations.