• So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.

    让我们开始仔细讲讲一个问题,那就是背包问题。

    youdao

  • Let's now go back and instantiate these ideas for the knapsack problem we looked at last time in particular, for the 0-1 knapsack problem.

    让我们回来用具体例子,来说明我们上次看过的背包问题,特别是对0 - 1背包问题来说。

    youdao

  • And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators.

    并且结合背包问题实例,给出了具体的编码方法,运行参数,群体大小,最大迭代次数,以及合适的遗传算子。

    youdao

  • And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators.

    并且结合背包问题实例,给出了具体的编码方法,运行参数,群体大小,最大迭代次数,以及合适的遗传算子。

    youdao

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

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

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