np-hard meaning in Chinese
困难性
Examples
- It has been proven in theory that the jssp is a classical np - hard
在理论上已经证明， jssp是一个np难题。 - Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于该问题不能在多项式时间内求得最优解，因而被公认为一个np完全问题。 - Because building optimal fuzzy decision tree is np - hard , it is necessary to study the heuristics
由于构建最优的模糊决策树是np - hard ，因此，针对启发式算法的研究是非常必要的。 - The genetic algorithm ( ga ) is a new parallel optimize algorithm , which can be used to solve many kinds of np - hard problems
遗传算法是一种用于解决优化问题的并行寻优算法,已被广泛用于解决各类np问题。 - In real shopfloor scheduling scenarios , resource restriction coexists with process restriction , which makes shopfloor scheduling problems np - hard
但是，资源约束和工艺约束的并存，使得车间调度成为一类np - hard问题。