在此基础上给出了一种基于超图的求最小覆盖集的新方法。
Following this, a new method based on supergraph for minimal cover is given.
并给出了最小覆盖、闭包求解的新算法,进行了相关算法分析。
New algorithms to find out minimum cover and closure are given and the relevant algorithms are analyzed.
在此基础上,给出了一个GD -约束集成为最小覆盖的充要条件。
Based on this, the sufficient and necessary condition under which a set of GD-Constrai NTS is a minimal cover is given.
因此,对水下隧道的最小覆盖层厚度进行研究具有较大的工程意义。
Therefore, to investigate the minimal thickness of covering layer of underwater tunnel is greatly engineeringly significant.
根据这些定理,给出了基于MVD模式矩阵的多值依赖最小覆盖算法。
Based on these theorems, gives the minimum cover algorithm of the multivalued dependency based on the MVD schema matrix.
该算法利用基于相容关系的属性最小覆盖来求解对象各属性的对象属性信息粒。
Firstly, based on attribute minimum covers and tolerance relation, object attribute information granulations of attributes of objects are generated.
同时,基于最小覆盖率和最小错误率给出了一种克服过学习问题的后处理方法。
A post pruning procedure is designed to deal with the overfitting problem, and two criteria that are the minimum covering rate and the minimum error rate are defined.
代数拓扑方法用于逻辑综合得到最小覆盖,为了避免可能出现冒险,需要进行冒险问题的讨论。
Method of algebraical topology used in logic synthesis attained least covering, and in order to avoid audaciousness arising, auducious problem was discussed necessarily.
同时,还定义了与它相关的几个概念,讨论了标准FD集f成为最小覆盖的充要条件及其它问题。
Meanwhile, several relational concepts are defined, and the full and necessary condition under which the standard FDs set becomes a minimum cover, and other problems are discussed.
但是提供了一个思路,枚举的时候如果点非常多,是否可以从直径开始找最小覆盖圆,效率是否会更优?
You are to write a program to find a circle which covers a set of points and has the minimal area. There will be no more than 100 points in one problem.
在给定关系模式的属性集及其函数依赖最小覆盖集的基础上,提出一种基于模式图的规范化XML模式设计方法。
Given attribute set and minimum cover set of functional dependencies over one relational schema, a new method for designing normalized XML schemas based on schema graph is proposed.
无论剩下了什么,你需要创建最小数量的覆盖全部情形的测试用例。
From whatever is left, you need to create a minimum number of test cases that cover all the conditions.
这需要识别每个功能性组使用的最小应用程序子集,只覆盖必需的功能。
It is performed by the identification of the minimal subset of applications used by each functional segment, which covers at least the minimal required functionality.
IBMRational QualityManager包含了一些技术,这些技术是用来自动识别,和为特定层次的环境覆盖率选择的最小测试请求。
IBM Rational Quality Manager includes technology that is designed to automatically identify and select the minimum number of tests required for a given level of environment coverage.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
首先,物质是最弱的,最小的等离子场强些,磁场最强,而且物质覆盖了它所有的频谱,无论上面还是下面。
First of all, matter is the weakest. The smallest plasma field strength, and plasma covers the full spectrum of the matter, above and below it.
该模型首先将问题解空间的DNA分子固定在固体载体上,然后通过进行相应的生化反应来求得图的最小顶点覆盖问题的所有解。
The DNA molecules of the solution space are fixed on the solid carrier, and then get the all solutions of minimal vertex covering problem by the biochemical actions.
根据数值模拟结果进一步确定象山港海底隧道的底板线位置和最小岩石覆盖厚度。
The location of soleplate line and the thickness the minimum rock cover are further studied through numerical simulation.
所有的关联规则都可以通过覆盖最小的关联规则集得到。
All association rules can be derived by covering the smallest association rule set.
本文提出组密钥分发的最小准确覆盖问题,并证明一种启发式的解。
In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristic solution is testified.
进一步分析了求解基于最大流划分的最小弱顶点覆盖集的近似算法。
Finally the approximation algorithm for the minimum weak vertex cover set is analyzed based on the maximal flow partition.
在北美与欧亚大陆之间的环绕北极的水域。是世界上最小的大洋,终年覆盖着浮冰。
The waters surrounding the North Pole between North America and Eurasia. The smallest ocean in the world, it is covered by pack ice throughout the year.
哈勃太空望远镜最近发现了第四颗绕行冥王星的卫星。天文学家们暂时把它命名为P4。该是迄今为止发现的围绕这颗冰雪覆盖的矮行星的最小的卫星。
Hubble recently showed a fourth moon orbiting Pluto. Astronomers temporarily named it P4. The moon is the smallest to be discovered around the icy dwarf planet.
保持透明(透明度混合)屏幕覆盖范围最小。
Keep Transparent (alpha blend) screen coverage to a minimum.
最后我们利用粘贴模型的基本原理,运用荧光标记技术,提出了最小顶点覆盖问题的表面技术解决方案。
Finally, the solution of the minimal covering problem on surface using fluorescence marking technology is proposed based on the principle of sticker model.
对一个图而言,满足此条件的最小的自然数即为此图的覆盖数。
The cover pebbling number for lexicographic product graphs and some strong product graphs were determined.
基于隧道涌水量解析公式,从隧道涌水量的角度出发考虑确定海底隧道的最小岩石覆盖厚度。
Based on the analytic formula of groundwater inflow into tunnel, this paper puts forward a method to choose the minimal rock cover of sub-sea tunnel.
该算法可以求得两个半径相等而且最小的圆覆盖点集。
Through the algorithm can be obtained a set of points covered by two equal radii and the smallest circle.
该算法可以求得两个半径相等而且最小的圆覆盖点集。
Through the algorithm can be obtained a set of points covered by two equal radii and the smallest circle.
应用推荐