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

    算法解决0-1背包问题

    youdao

  • This is about 01 knapsack problem dynamic programming algorithm.

    关于01背包问题动态规划算法

    youdao

  • Particle Swarm Optimism; Knapsack Problem; genetic probability;

    粒子优化算法;背包问题遗传概率;

    youdao

  • Trial designed recursive algorithm for solving knapsack problem.

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

    youdao

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

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

    youdao

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

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

    youdao

  • In theory, the layout problem of storage space can be interpreted as a knapsack problem.

    理论上讲仓储空间布局问题可以理解背包问题。

    youdao

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

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

    youdao

  • A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.

    提出系统多选择背包问题融合的算法。

    youdao

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

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

    youdao

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

    另外讨论了拼板问题背包问题问题的关系

    youdao

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

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

    youdao

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

    算法设计分析经典程序主要有0 - 1背包问题最小生成

    youdao

  • This article proposes a new easy knapsack problem, based on which a novel knapsack-type public key cryptosystem is derived.

    该文提出了一类新的背包问题基于此问题构造了一个新的加法背包公钥密码体制。

    youdao

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

    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

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

    本文通过研究公钥密码学中的次背包体制,给出基于二次背包加密的数字水印算法

    youdao

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

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

    youdao

  • So I haven't done magic, I've given you a really fast way to solve a knapsack problem, but it's still exponential deep down in its heart, in something.

    所以没有魔法,我已经告诉了一种快速解决背包问题方法了,但是某些方面核心仍然指数增长的。

    youdao

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

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

    youdao

  • 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.

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

    youdao

  • 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.

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

    youdao

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

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

    youdao

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

    本文提出了改进粒子算法求解背包问题,阐明了算法求解背包问题具体实现过程

    youdao

  • 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.

    最大问题进行松驰思想应用背包问题上,得到二次背包问题的松驰模型

    youdao

  • 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.

    基于问题蚂蚁算法本文矩形件排样问题转化一维背包问题,然后进行求解

    youdao

  • 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.

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

    youdao

  • 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.

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

    youdao

  • 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.

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

    youdao

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

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

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