| 单词 | NP-complete problem | ||
| 释义 | NP-complete problem
例句释义: 问题 1. As an NP complete problem, grid workflow scheduling is usually solved by means of heuristics. 作为一个NP完全问题，通常采用启发式算法来解决网格工作流调度。 www.ceps.com.tw 2. In the half a century since the problem was recognized, no one has found an efficient algorithm for an NP-complete problem. NP完备问题被确认至今已有半个世纪之久，到目前为止还没有人找到它的有效演算法。 edba.ncl.edu.tw 3. It is proved that this problem belongs to NP complete problem, and it needs to be solved by random method. 首先证明了该问题属于NP完备问题，因此必须使用随机算法代替穷举来求解。 www.ceps.com.tw 4. It have been proved that RWA (routing and wavelength assignment) algorithm in arbitrary mesh optical networks is a NP-complete problem. 光网络中的路由和波长分配（RWA）算法是NP难问题。 airiti.com 5. Production scheduling problem has been shown to be a NP complete problem. 经证明，生产调度问题是NP完全问题。 www.boshuo.net 6. Subgraph isomorphism is NP-Complete problem. So must avoiding subgraph isomorphism by canonical code and efficient algorithm. 因此，必须有个好的规范化编码和有效的算法来避免子图同构这个难题。 www.ceps.com.tw 7. First the problem was modeled as an instance of vertex cover problem which was an NP -Complete problem. 先把该问题归结为图的顶点覆盖问题，它是一个NP完全问题； dictsearch.appspot.com 8. Aiming at the critical areas coverage NP-complete problem, a heuristic critical areas coverage optimization algorithm(CACOA) is proposed. 针对无线传感器网络中的关键区域覆盖NP完全问题，提出了一种启发式的关键区域覆盖优化算法CACOA。 www.dictall.com 9. Graph vertex coloring problem (GVCP) is a NP-complete problem having good application such as scheduling and timetabling. 本文对图与组合优化问题中的一个典型问题，即图的顶点着色问题进行了研究。 www.dictall.com 10. This is analogous to the NP Complete problem. 这与NP完全问题是类似的。 www-128.ibm.com 1. approximate method for NP complete problem NP完全问题近似方法 zh.wikipedia.org |
||
| 随便看 |
|
英汉双解词典包含2704715条英汉词条，基本涵盖了全部常用单词的翻译及用法，是英语学习的有利工具。