the knapsack problem
网络释义
...O(n O(n lg lg n) n) 真理大学资讯工程系 演算法Algorithm ( 吴汶涓) 41 ☆ ☆☆ ☆ ☆ ☆☆ ☆The Knapsack Problem (背包问题) Def: 所谓Knapsack Problem，是指有n个物品和一个背包， 其中: 物品具有重量(w 1 , w 2 , …, w n ) 和利润(p 1 , p 2 , …
基于96个网页-相关网页
双语例句原声例句
-
So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
让我们开始仔细讲讲一个问题，那就是背包问题。
-
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背包问题来说。
-
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.
并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。
-
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背包问题来说。
-
So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
让我们开始仔细讲讲一个问题，那就是背包问题。
-
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
应用推荐