您要查找的是不是:
- DNA computing model and algorithm for the minimal covering problems by plasmids were presented. 给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法.
- An Improved Sticker Model of the Minimal Covering Problem 最小顶点覆盖问题的改进粘贴模型
- minimal covering problem 最小顶点覆盖问题
- In order to resolve the minimal set covering problem availably, the sticker model of DNA computation based on sticking operations is introduced. 摘要运用DNA计算模式中基于粘贴运算的粘贴模型求解最小集合覆盖问题。
- 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. 在粘贴模型中,用存储复合体来表示子集,并利用粘贴运算的巨大并行性,可以有效地求解最小集合覆盖问题。
- LIU Ren-ren.The minimal covering of precomplete sets in partial three-valued logic[J].Natur Sci J Xiangtan University,1991,13(2):158 -164. [6]刘任任.;部分三值逻辑中准完备集的最小覆盖[J]
- We used the well-known set covering problem (SCP) to model the vehicle routing problem and developed a Lagrangian relaxation based heuristics. 本研究将车辆路线问题转以集合涵盖问题描述,再以常用之拉氏松弛法为基础,结合变数产生法之观念来设计一启发式演算法。
- The direct dependency graph(DDG),direct dependency matrix(DDM),dependency relation matrix(DRM),degree of direct dependency(DDD) and minimal cover(MC) were defined. 然后定义了直接依赖图、直接依赖矩阵、直接依赖度、依赖关系矩阵和最小覆盖等概念。
- Han, A. F. (1994), "Hybrid Heuristic Methods for Set Covering Problem," paper presented at the TIMS/ORSA Joint National Meeting, Boston, USA, April 24-27, 1994. 韩复华;游进俊(1993);"静态拨召服务问题启发式解法之研究;"中华民国运输学会第八届学术论文研讨会论文集;473至480页;民国82年12月.
- A variation of one-dimensional bin packing problem: the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed. 摘要文章介绍一维装箱问题的一个衍生问题:最小基数箱子覆盖问题和它的一个启发式算法。
- The terminal path cover problem is to find a terminal path cover of G of minimum cardinality with respect to T. 终端路迳覆盖问题在于找到一个相对于T的G上最少路迳数的终端路迳覆盖。
- This paper uses an improved re peti tioninclusion algorithm to find the essential prime implicants, to determine t h e minimal cover with the chooser principle, and to process the cyclical function s. 针对计算机化简逻辑函数普遍存在操作复杂、存贮容量大、运算速度慢等问题,该文用改进的重复包含算法寻找逻辑函数的质蕴涵,选择极值法求最小覆盖,并对循环函数进行处理。
- First the problem was modeled as an instance of vertex cover problem which was an NP-Complete problem. 先把该问题归结为图的顶点覆盖问题,它是一个NP完全问题;
- Minimization algorithms of logic function involve two main steps: generation of prime impli-cants and extration of a minimal cover from those primes. 逻辑函数的最小化算法可分为两大步骤:产生本源蕴涵项和在这些蕴涵项中选择一个最小覆盖。
- This paper presents the modeling process of the key covering problem(KCP) in the group rekeying and the transformations between the KCP and the vertex covering problem(VCP) in the graph theory. 本文给出了密钥覆盖问题模型的建立过程,首次给出密钥覆盖问题(KCP)与顶点覆盖问题(VCP)的相互变换。
- Resarch on the Problem for Finding a Minimal Cover of a Set of GD-Constraints GD-约束集最小覆盖求解的研究
- The front cover of the novel has been torn off. 这本小说的封面已被撕掉。
- I look at this problem from a different viewpoint. 我从不同的观点来看这个问题。
- Based on population-based incremental learning (PBIL) algorithm, a fast algorithm is presented with heuristic feasible operator (HFO) to solve some binary code covering problems. 在基因概率学习算法(PBIL)的基础上,建立码覆盖问题的目标函数,引进启发式算子HFO,针对局部陷阱设计跳出策略,从而获得一种新的快速求解码覆盖问题的算法。
- She skirted round the problem of the high cost. 她避而不谈巨额费用问题。