这样一个问题甚至可以难到最聪明的人，对年轻的亚瑟王来说，这就像一个不可解的问题。
Such a question would perplex even the most knowledgeable man, and, to young Arthur, it seemed an impossible query.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
The braid group is infinite non-commutative group, and it has many hard problems that can be utilized to design cryptographic primitives, such as the word problem, conjugacy problem and root problem.
路网结构的复杂性和运输生产的动态性，决定了要获得较大规模的实际空车调配问题的最优解是不可能或非常困难的。
Because of the complexity and dynamic nature of the railway transportation network, it is difficult, or even impossible, to find an optimal solution for an actual large scale empty car distribution.
然而精确地解子问题太昂贵有时也不可能，在许多文献里讨论了不精确邻近点算法(IPPA)。
However, solving the sub-problems is either expensive or impossible. The inexact proximal point algorithm (IPPA) was developed in many literature.
在那么多个世纪里，最早的美洲土著人一直在做什么呢？这个问题的答案在很大程度上是神秘而不可解的。
What were the earliest Americans doing for those many centuries? To a great extent, the answer is shrouded in mystery.
辫群是一种非交换的无限群，该群中有许多困难问题是不可解的，如字问题、共轭问题和根问题等，利用这些困难问题可以去设计一些密码协议。
The braid groups have many hard problems that can be utilized to design cryptographic primitives, for example, the word problem, conjugacy problem, and root problem.
对过椭圆外一定点的法线作图问题作了探讨，指出了几何作图法的不可解性。
This paper discusses the graphic problem of ellipse normal through a point outside the ellipse. Concluded are the unsolvability of geometric graphic method to solve this problem .
通过对遗传算法编码方法的改进和对辐射型网络的修复，合理的排除了大量的不可行解，解决了遗传算法计算时间长、搜索空间大的问题，提高了程序的计算速度。
The paper improved the coding mode and repaired the radial pattern networks, so breeds out the infeasible solution reasonably, tails off the search space and boosts the procedure's calculating speed.
你们这代人中的甘冒风险者激发了信息和技术领域的不可思议的进步可能改变我们解 决几乎是任何问题的方法。
Incredible advances in information and technology spurred largely by the risk-takers of yourgeneration have the potential to change the way we do almost everything.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms (GA) searching for the best solution.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最 优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop Scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms(GA) searching for the best solution.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最 优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop Scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms(GA) searching for the best solution.
应用推荐