毕业论文天下网_最优化软件设计实现_通信毕业论文格式范文 关键词：n维立方体；星积运算；锐积运算；最小覆盖 [gap=1394]Keywords: N-cube; Star-operation; Sharp-operation; Minimal cover
基于72个网页-相关网页
Some simple separable function sets must be the component part of the minimal covering of precomplete classes in P*k.3.
2．证明了一类单纯可离函数集必须在部分多值逻辑中的极大封闭集的最小覆盖中出现。
参考来源 - 部分多值逻辑中Sheffer函数的判定Bipartite graph which is consists of prime implications and minterms is structured. The least prime implicants containing all of the minterns, that is, the minimum coverage of logic functions is obtained by heuristic approach.
构造质蕴涵项与最小项关联图，利用启发式规则得到能蕴涵全部最小项的最少质蕴涵项集合，从而得到逻辑函数的最小覆盖，完成逻辑函数化简。
参考来源 - 改进的QBasing on the algorithm of the weighted vertex cover algorithm, this paper presents a new method of decision selection with the same time complexity and more benefit.
然后利用图重写规则,提出了一种可以获得更优决策集合的方法,在改进的求带权二分图最小覆盖的方法的基础上,获得了一种具有相同时间复杂度和更高代价利益比的方法。 整个模型高效、易于管理。
参考来源 - 一种基于图重写的计算机安全风险分析系统 in CIn the fourth chapter, we proved the rest 16 classes sum to 32 of precomplete sets deducted from chapter 3 must among the minimal covering of precomplete sets in partial four-valued logic.
在第四章中,证明了第三章中未剔除的16类32个保三、四元的单纯可离函数集必在最小覆盖中出现,从而定出了部分四值逻辑准完备集之最小覆盖中所有保三、四元单纯可离关系的成员。
参考来源 - 部分四值逻辑中保三、四元单纯可离关系函数集最小覆盖之确定·2,447,543篇论文数据，部分数据来源于NoteExpress
在此基础上给出了一种基于超图的求最小覆盖集的新方法。
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.
应用推荐