• Maximum power estimation is a NP-hard problem.

    最大功耗估计问题一个NP难题。

    youdao

  • We show that both the reverse problems are strongly NP-hard.

    我们证明两个网络选址问题都是np困难的。

    youdao

  • But it is a NP-Hard problem to get the minimal attribute reduction.

    求取任意问题最小属性集一个NP难问题。

    youdao

  • The max-cut problem is a standard NP-hard problem in graph graphic theory.

    最大问题图论中的一个典型NP困难问题。

    youdao

  • The minimum distance decoding of linear codes is NP-hard, but some solvable cases exist.

    线性分组码最小距离译码NP -难问题有些情况可解。

    youdao

  • It has been proved that computing most of these new vulnerability parameters are NP-hard.

    证明计算一般图的这些参数NP-困难问题。

    youdao

  • It is known that the problem is APX-hard for general graphs and NP-hard for planar graphs.

    问题一般APX困难问题,在平面图下是NP困难问题。

    youdao

  • Solving NP-hard problems is always the bottleneck task in the field of computer science and technology.

    求解np难度问题一直计算机科学技术的一个瓶颈任务

    youdao

  • The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.

    带有时间车辆优化调度问题VSP复杂程度更高的NP难题

    youdao

  • The problem is known to he NP-hard when the waiting-time extension coefficients have two arbitrary values.

    两合机器的情况下,延伸系数允许两个不同时,问题证明难问题。

    youdao

  • Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.

    布局优化NP问题也是复杂非线性约束优化问题。

    youdao

  • It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization.

    由于定位-车辆路线问题组合优化问题一个典型NP难题大规模时难以精确求解

    youdao

  • The modern scheduling problems are more complex than classical scheduling problems, most of which are NP-hard problems.

    这些现代排序问题经典排序问题更为复杂绝大多数都是NP-难问题。

    youdao

  • The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.

    单机模糊交货期加权满意程度最大化问题一个NP -问题。

    youdao

  • In this paper we propose there efficient arithmetic-weal search, much space search and overall situation search for sowing NP-hard problem.

    提出种有效的快速算法——局部搜索空间搜索全局搜索解决NP难度问题

    youdao

  • In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of scheduling and code optimization.

    复杂性理论中,此问题一类重要NP问题广泛应用调度代码优化和生物信息学等领域

    youdao

  • There are a lot of NP-hard optimization problems in the engineering application, which are difficult to solve by traditional mathematical techniques.

    实际工程应用很多优化问题NP难问题,难以应用传统数学方法解决

    youdao

  • It is easily shown that this problem is NP-hard, and a dynamic programming algorithm and a branch-and-bound algorithm are developed to solve it optimally.

    文中简单说明问题NP -难问题,提出了动态规划算法一种分枝定界算法求得此问题的最优解

    youdao

  • As a combinatorial optimization problem, three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution.

    作为一类组合优化问题,多约束条件下的装载问题属于NP - Hard问题,求解也是相当困难的。

    youdao

  • Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.

    由于在这样环境找到个最调度NP问题通常运用各种启发式算法找到近似最优

    youdao

  • The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.

    最小标记生成就是其中之一,目标给出一个边上带有颜色的,计算使用颜色种类最少的生成树。

    youdao

  • But the RWA in mesh networks is a NP-hard problem which can not be solved optimally with exhaustive search in the endurable time. Hence, we designed a heuristic algorithm to solve it.

    网络中的RWA是个NP -问题可能有限的时间内通过穷举搜索来获得其优化解,为此我们设计了启发性算法解决这个问题。

    youdao

  • It has been proved the computation of minimal reduction and full reduction both is NP-hard problem, in artificial intelligence the common way is to employ heuristic knowledge to reduce.

    研究表明最小计算全部约简的求算NP问题人工智能中,解决类问题的一般方法利用启发式信息进行约简。

    youdao

  • Great challenges and barriers exist in both theory and practice due to the NP-hard of layout problems in computation complexity and alarming difficulties in the design of spacecraft themselves.

    布局问题NP -困难性航天器设计本身的巨大复杂性使得问题的解决既有理论上的开拓性和挑战性,又存在工程实践上的艰难性和复杂性。

    youdao

  • MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.

    约束多车场开放式车辆路径问题基本车辆路径问题上增加了时间约束多车场作业的变化形式,是一个典型NP-难问题。

    youdao

  • Solving NP hard problems is always the bottleneck task for computer science and techniques.

    求解np问题一直计算机科学技术中的一个瓶颈任务

    youdao

  • The feature subset selection is an important problem in machine learning, but the optimal feature subset selection is proves to be a NP hard one.

    特征子集选择问题机器学习重要问题。优特征子集的选择是NP困难问题,因此需要启发式搜索指导求解。

    youdao

  • The problem is known as NP hard no matter whether group sub lotting is admissible or not.

    无论是对于成组加工情形还是分组情形,问题都可以证明NP困难的。

    youdao

  • The problem is known as NP hard no matter whether group sub lotting is admissible or not.

    无论是对于成组加工情形还是分组情形,问题都可以证明NP困难的。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定