背包算法用英语怎么说，背包算法的英文翻译

词语导航

基本信息

词语：背包算法

繁体：背包算法

拼音：bèi bāo suàn fǎ

英语翻译

【计】 knapsack algorithm

分词翻译

背包的英语翻译：

knapsack; pack

算法的英语翻译：

algorithm; arithmetic
【计】 ALG; algorithm; D-algorithm; Roth"s D-algorithm
【化】 algorithm
【经】 algorithm

翻译例句

1. 与传统的背包算法不同的是，该算法适合于多维目标优化。

Being different from the traditional Knapsack algorithm, KFA is for multiple-objective optimization.

2. 但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。

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.

3. 因为正如我们已经归越过的，对于一般连续性背包问题贪婪算法很实用。

With the continuous knapsack problem as we"ve formulated it, greedy is good.

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

This is about 01 knapsack problem dynamic programming algorithm.

5. 因此，应用该混合智能算法求解0 - 1背包问题是比较有效的。

Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems.

6. 本文对线性约束不可分离凸背包问题给出了一种精确算法。

In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.

7. 算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。

Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.

8. 实验结果表明，采用此算法能快速有效地解决背包问题。

The experimental results show that it is a fast and efficient method for knapsack problem.

9. 提出了0-1多项式背包问题的一种新的精确算法。

This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.wwW.weNtiYI.Com

10. 基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。

Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.

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

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.

12. 给出了用这三种算法解决多选择背包问题的基本原理及求解步骤。

The basic principle and step of these three algorithms are given to solve Multiple-choice Knapsack Problem.

13. 本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。

In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.

14. 针对经典的背包问题，给出一种新的基于蚂蚁优化思想的求解算法。

Based on the ant colony optimization idea, this paper presents a new algorithm for the classical knapsack problem.

15. FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；

The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.

16. 本文通过研究公钥密码学中的二次背包体制，给出了一种基于二次背包加密的数字水印算法。

In this paper, we propose a new digital watermarking algorithm based on quadratic knapsack problem, which belongs to public-key cryptosystem.

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

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.

18. 用蚁群算法解决0-1背包问题。

Using ant colony algorithm to solve 0-1 knapsack problem.

19. 提出了解决多背包问题的遗传算法。

A genetic algorithms is applied to solute such a complex problem.

20. 数值实验表明，引入邻域搜索机制的NSGA - II算法在求解多目标0 - 1背包问题时表现出更好的性能。

The numerical experimental results show that NSGA-II with the neighborhood search can outperform NSGA-II applied to multi-objective 0-1 knapsack problems.

21. 通过求解背包问题对算法进行验证，实验结果表明所提算法性能较优。

This algorithm is verified by solving knapsack problem, the results of the experiment show that the proposed algorithm can result in better profits.

22. 实验证明采用这种改进的粒子群算法解决多约束背包问题切实可行， 搜索效率较高。

The result of this experiment shows that this particle swarm algorithm is available and efficient in solving multi-c…

23. 试用递归方法设计求解背包问题的算法。

Trial designed recursive algorithm for solving knapsack problem.

24. 本文针对组合优化问题，基于分布估计算法主要开展了如下研究：针对多维背包问题，设计了一种混合分布估计算法。

Aiming at combinatorial optimization problems, this paper carries out the following main research work based on EDA. A hybrid EDA is proposed to solve the multidimensional knapsack problems (MKP).

25. 针对0-1 背包问题，提出一种具有修复策略的、贪心算法与二进制粒子群算法相结合的混合智能算法。

The simulation result indicates that the performance of BSPSO on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms.

26. 粒子群优化算法；背包问题；遗传概率；

Particle Swarm Optimism; Knapsack Problem; genetic probability;

27. 粒子群优化算法；背包问题；遗传概率；

Particle Swarm Optimism; Knapsack Problem; genetic probability;