片语

Knapsack k Problem背包问题

Knapsack Problem Greedy Solution背包问题贪心解法

concave knapsack problem凹背包问题

Knapsack Problem Solving背包问题求解

multi dimension knapsack problem多维0

Research on Knapsack Problem背包问题的探讨

英汉例句

• 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背包问题来说。

• This is about 01 knapsack problem dynamic programming algorithm.

  这是关于01背包问题的动态规划算法。

• The relations among the board welding problem, knapsack problem and cutting stock problem are also discussed.

  另外还讨论了拼板问题、背包问题和下料问题的关系。

• By making use of simulated annealing algorithm with memory, and determining a set of effective cooling schedule, the thesis solves this complex and special knapsack problem successfully.

  本文应用带记忆功能的模拟退火演算法，结合理论分析和经验法则，通过大量试验确定了一组有效的冷却进度表参数，成功地解决了这个复杂而特殊的背包问题。

• The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.

  把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。

• The precise and approximate algorithms solving 0-1 knapsack problem, precise algorithm could not be used to solve 0-1 knapsack problem in a short time, so it could not be applied extensively.

  求解0 - 1背包问题的精确算法不能在较短时间内求解大规模0 - 1背包问题，使其实用性受到限制。

• The function optimization and knapsack problem show the effectiveness of PEA.

  函数优化和背包问题实验验证了PEA的有效性。

• For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solution.

  对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行解。

• Under the assumption that the random high-density knapsack problem is infeasible, the proposed schemes are provably secure against ciphertext-only attack.

  在高密度随机背包困难性假设下，可以证明方案在唯密文攻击下是安全的。

• For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solutio.

  对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行。

• From the viewpoint of intensifying convergence and reducing dependency of parameters, a genetic annealing evolutionary algorithm that can be applied for solving knapsack problem is proposed.

  从增强算法收敛性和减少参数依赖性的角度出发，提出应用遗传退火进化算法求解背包问题。