您要查找的是不是：
- 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)的相互变换。
- On the Modeling Transformations and Approximation Algorithms of Key Covering Problem in the Group Rekeying 密钥覆盖问题的建模、变换及近似算法
- On the proof of the NP-completeness of key covering problem in the group rekeying 密钥覆盖问题的NP完全性证明
- key 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计算模式中基于粘贴运算的粘贴模型求解最小集合覆盖问题。
- We used the well-known set covering problem (SCP) to model the vehicle routing problem and developed a Lagrangian relaxation based heuristics. 本研究将车辆路线问题转以集合涵盖问题描述，再以常用之拉氏松弛法为基础，结合变数产生法之观念来设计一启发式演算法。
- 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上最少路迳数的终端路迳覆盖。
- First the problem was modeled as an instance of vertex cover problem which was an NP-Complete problem. 先把该问题归结为图的顶点覆盖问题，它是一个NP完全问题；
- 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. 在粘贴模型中，用存储复合体来表示子集，并利用粘贴运算的巨大并行性，可以有效地求解最小集合覆盖问题。
- Do you know the key to the problem? 你知道这道题的答案吗？
- DNA computing model and algorithm for the minimal covering problems by plasmids were presented. 给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法.
- 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,针对局部陷阱设计跳出策略,从而获得一种新的快速求解码覆盖问题的算法。
- You may leave your key at the reception desk. 你可以把钥匙留在服务台。
- He put the key in the lock and turned it. 他把钥匙插入锁里转动。
- I have mislaid my key to the door. 我不知道把门钥匙放到哪里了。
- A Heuristic Algorithm for Set Covering Problem 一种求解集合覆盖问题的启发式算法
- He's locked in and nobody knows where the key is. 他被锁在房间里，没有人知道钥匙在什么地方。
- Solving Point Covering Problem by ant-algorithm 点覆盖问题的蚂蚁算法求解
