的优化问题 - 翻译成英语

• optimization problem
• optimization problems
• optimization issues

在 中文 中使用 的优化问题 的示例及其翻译为 英语

但是如果你有一个可以概括肿瘤如何生长和对治疗作出反应的模型，那么它就成了一个典型的工程优化问题。
But if you have a model that can recapitulate how tumors grow and respond to therapy, then it becomes a classic engineering optimization problem.

深度学习在很大程度上是在解决大规模的烦人的优化问题。
Deep Learning, to a large extent, is really about solving massive nasty optimization problems.

会议感兴趣的优化问题涉及与结构和材料的大小，形状和拓扑有关的问题。
Optimisation problems of interest to the meeting involve those related to size, shape and topology of structures and materials.

在某些情况下，忽视动画和图片的优化问题会影响到网页图像质量。
In some instances, ignoring pixilation or image optimizing issues can result in affecting quality of webpage graphics.

这里有一个更有趣的例子，涉及到在现代机器学习中出现的优化问题。
Here's a more interesting example, related to the kinds of optimization problems that show up in modern machine learning.

信号处理中的优化问题.
Optimization problems in signal processing.

比如我们需要解决如下的优化问题：.
We need to solve the following optimization problem.

比如我们需要解决如下的优化问题：.
We want to solve the following optimization problem.

这意味着我们需要解决如下的优化问题：.
It means we need to solve the following optimization problem.

这意味着我们需要解决如下的优化问题：.
We need to solve the following optimization problem.

这意味着我们需要解决如下的优化问题：.
In other words, we want to solve the following optimization problem.

SVM通过解决如下的优化问题来寻找最优超平面：.
SVM finds the decision surface by solving the following optimization problem.

然后支持向量机出现了，声称其效果更好，因为相关的优化问题是凸面的。
Then support vector machines came, claiming to be better because the associated optimization problem is convex.

通过近似和线性化，许多工程问题最后可以转换成欧式空间上的优化问题。
Through approximation and linearization, many engineering problems can finally be converted into European-style optimization problems.

结果表明，修改后的优化问题可以重新作为贴现微分博弈在无限的时间间隔。
It was shown that the modified optimization problem can be reformulated as a discounted differential game over an infinite time interval.

结果表明，修改后的优化问题可以重新作为贴现微分博弈在无限的时间间隔。
It was proven that the modified optimization problem could be reformulated as a discounted differential game over an infinite time interval.

但是，基于模型的优化问题中的约束确保了只能输出最上面一行的轨迹。
However, the constraint in the model-based optimization problem ensures that only trajectories like the top row will be outputted.

为了解决由此产生的优化问题，我们提出了一种遗传算法，因为该问题具有NP难度性质。
To solve the resulting optimization problem we propose a Genetic Algorithm due to the NP-hard nature of the problem..

但是，基于模型的优化问题中的约束确保只有像第一行这样的轨迹才能被输出。
However, the constraint in the model-based optimization problem ensures that only trajectories like the top row will be outputted.

虽然这些行业中最棘手的优化问题难倒了经典计算机，但量子机器非常适合解决这些问题。
While the toughest optimization problems in these industries stump classical computers, they are well-suited for being solved on a quantum machine.