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.