NP-complete problems NP完全问题
np complete problems np完全问题
np hard problems np难度问题
np difficulty problems np困难问题
class np of problems NP问题类
Basic NP-complete problems 基础NP完全问题
Design the test programs (CAP) to resolve NP problems (Course Arrangement) with GAs; Based on RECGA, modify the Arithmetic and then conduct tests.
使用遗传算法设计了解决NP类问题(排课问题)的测试程序(CAP)，并根据RECGA对算法进行改进并进行测试。
MuSTSP is a kind of NP problems with complex requirements and constraints. It also has some special characteristics, such as hard time window constraints.
多星测控调度问题是一类NP问题，需求复杂、约束众多，具有诸如强时间窗约束等特点。
This article tries to apply genetic algorithms to label point lettering automatically according to the viewpoint that automatic lettering is one of the hard NP problems.
从注记配置是一个NP难度问题这一观点出发，尝试性地将遗传算法用于点注记自动配置。
应用推荐