集合覆盖（篮球）问题
清单7 . glpsol对集合覆盖问题的报告。
问题就成为了带有权重的集合覆盖问题。
提出了集合覆盖问题的一种随机近似算法。
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
Randomized algorithms for the set cover problem and its variations and duals.
集合覆盖贪心算法的推广被用来求解生物信息学中出现的冗余测试集问题。
The generalization of set cover greedy algorithm is used to solve the redundant test set problem arising in bioinformatics.
集合覆盖问题涉及的是二元决策变量；也就是说，它们的值只能是0或1、yes或no。
The set covering problem teaches binary decision variables; that is, they can only be 0 or 1, yes or no.
然后简单探讨了粗糙集理论的属性约简和集合覆盖问题，从而将二者联系起来。
Then discusses the attributes reduction based on Rough Set theory and set covering problem to combine them.
主要运用集合覆盖模型对城市地下物流系统的物流节点选址问题进行了初步的分析探讨。
This paper mainly introduces the set covering model to analyze locations for urban ULS logistics links.
本文将消防设施选址问题抽象成集合覆盖问题，应用蚁群算法对集合覆盖问题进行了求解。
This paper applies Set Covering model to modeling the facility location problem, then USES Ant Colony Algorithm to solve the Set Covering model.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
关于有限集合上的划分与覆盖，一般很少讨论和研究。
Generally speaking, there are few profound discussion and research on the partition and covering of finite set.
利用覆盖空间，得到了粗糙集和拓扑中更深刻的性质，从算子论和集合论的角度丰富和深化了粗糙集与拓扑的内容。
Furthermore the deeper properties of rough sets and topology are achieved by covering Spaces, and rough sets theory and topology have been enriched from the operator-oriented and set-oriented views.
给定一个循环码，求取它的覆盖多项式集合目前尚无系统的方法。
For a cyclic code, it is difficult to find the set of it's covering polynomials. We have not had a systematic method to find it.
但是，该方法的关键是寻求循环码的一个覆盖多项式集合。
The key point of this method is to find a set of covering polynomials.
故本文运用多项式核函数将人脸分布的低维空间映射到高维空间，并在此空间判别“待识别人脸”是否属十某个人脸覆盖集合。
Polynomial kernel function is applied to map face distribution of low dimension space to that of high dimension space, and decide which set that face to be recognized belongs to.
本文主要讨论集合的覆盖与集合上的相容关系之间的关系。
In this paper the relation of the compatibility relation on a set between the covering of a set have been dis-cussed.
我们提出了一个有效的方法组织这些节点分为不同的集合，每个集合的节点能够完全覆盖所有的目标，并且与网关节点连通。
An efficient approach is presented to organize the sensor nodes into different sets, each of which complete covers all the targets and remains connected to one of sinks.
该平台的一个特点是，根据指定的关键信号使用数据流分析产生关键路径集合，并采用基于该集合的路径覆盖率作为适应度函数引导模拟矢量的生成。
Given the critical signals, it USES techniques of data flow analysis to acquire the critical path set and choose the critical path coverage to be the fitness function used in the GA.
在此情况下，还原整个集合的原始状态的最安全的流程是：使用项目的所有原始属性值覆盖所有项目。
In this circumstance, the safest process to restore the original state of the entire collection is to overwrite all the items with all their original property values.
如果集合中已经存在指定的键，则设置此属性会用指定值覆盖现有值列表。
If the specified key already exists in the collection, setting this property overwrites the existing list of values with the specified value.
选拔算法是两级逻辑综合中求解最小化覆盖的经典方法之一，但在输出变量集合和质立方体集合规模较大的情况下，采用选拔法求最小化覆盖存在空间复杂度高、求解时间长等问题。
But as the output variables and the prime implicant grow up, both the long processing time and the resource requirement become the major problems to be resolved with the extraction method.
其二是在原始抗体集合产生的基础上对抗体分布的改进，也就是优化抗体对非我区域的覆盖。
One is the amelioration on calculating the size of the non-self space based on Monte Carlo simulation techniques, and another is the amelioration on antibody distribution.
其二是在原始抗体集合产生的基础上对抗体分布的改进，也就是优化抗体对非我区域的覆盖。
One is the amelioration on calculating the size of the non-self space based on Monte Carlo simulation techniques, and another is the amelioration on antibody distribution.
应用推荐