1)0/1 knapsack problem0/1背包问题
1.Hybrid genetic algorithm with high convergent speed for solving 0/1 knapsack problem;求解0/1背包问题的快速收敛的混合遗传算法
2.Solve 0/1 Knapsack Problem by a Hybrid Genetic Algorithm Based on Greed Algorithm;用基于贪婪算法的混合遗传算法求解0/1背包问题
3.Solution to the 0/1 knapsack problem based on particle swarm optimization of death penalty function;用带有死亡罚函数的粒子群优化算法求解0/1背包问题
英文短句/例句
1.Particle Swarm Optimization about 0/1 Knapsack Problem关于0/1背包问题的粒子群优化算法
2.Discrete Differential Evolution Algorithm for Solving 0/1 Knapsack Problem求解0/1背包问题的离散差分进化算法
3.Immune algorithm with antibody-repaired and its application for high-dimensional 0/1 knapsack problem抗体修正免疫算法对高维0/1背包问题的应用
4.Repair Strategies for Multiobjective 0/1 Knapsack Problem in MOEA多目标0/1背包问题MOEA求解中的修复策略
5.A Method for 0/1 Knapsack Problem Which Value Equal with Weight价值与重量相等的0/1背包问题的一种解法
6.Binary PSO Algorithm for Multiple 0/1 Knapsack Problem求解多维0/1背包问题的二元粒子群算法
7.Genetic algorithm with schema replaced for solving 0/1 knapsack problem一种基于模式替代的遗传算法解0/1背包问题
8.In this paper, we try to apply Binary System Particle Swarm Optimization (BSPSO) with death Penalty function to solve 0/1 knapsack problem.将带有死亡罚函数的二进制粒子群优化算法应用于0/1背包问题。
9.On the Sequential Combination Tree Algorithm for 0-1 Knapsack Problem;有序组合树法求解0-1背包问题初探
10.Solving the 0-1 s knapsack Problem by Genetic Algorithm;用基本遗传算法解决0-1背包问题
11.New genetic algorithm to solve 0-1 knapsack problem一种求解0-1背包问题的新遗传算法
12.Formal Derivation of a Kind of 0-1 Knapsack Problems Algorithmic Programs一类0-1背包问题算法程序的形式化推导
13.Mixed Coding Greedy Differential Evolution Algorithm for 0-1 Knapsack Problem解0-1背包问题的混合编码贪婪DE算法
14.The study on greedy local search algorithm of 0-1 knapsack problem0-1背包问题的贪心局部搜索算法研究
15.Hybrid Genetic Algorithm for Multiconstraint 0-1 Knapsack Problem求解多限制0-1背包问题的混合遗传算法
16.The Study on Exhaust Slgorithm,Search Algorithm,Dynamic Design for 0-1 Knapsack Problem0-1背包问题之穷举、搜索、动态规划算法探讨
17.Binary differential evolution algorithm for 0-1 knapsack problem解0-1背包问题的二进制差异演化算法
18.Trying the CPSO for 0-1 knapsack problem混沌粒子群算法在0-1背包问题中的应用
相关短句/例句
0/1-knapsack problem0/1背包问题
1.Competitive decision algorithm for 0/1-knapsack problem;0/1背包问题竞争决策算法
2.Based on mathematical inference, this paper proposes a quick reduction algorithm for 0/1-knapsack problem.用数学方法分析了0/1背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优解中的物品和成批排除一定不在最优解中的物品。
3)0-1 knapsack problem0-1背包问题
1.New hybrib algorithm for solving 0-1 knapsack problem;一种新的求解0-1背包问题的混合算法
2.A Kind of Renewed Simulated Annealing Algorithm Solves 0-1 Knapsack Problem;一种改进的模拟退火算法求解0-1背包问题
3.Solving 0-1 knapsack problem based on ant colony optimization algorithm;基于蚁群优化算法的0-1背包问题求解
4)multi-objective 0/1 knapsack problems多目标0/1背包问题
1.A new algorithm for multi-objective 0/1 knapsack problems is proposed.提出一种用于求解多目标0/1背包问题的新算法。
5)0/1 multiple-choice knapsack problem0/1多选择背包问题
6)0-1 multi-dimensional knapsack problem0-1多维背包问题
1.Based on global evaluation model for Grid workflow,services selection was modeled as a 0-1 multi-dimensional knapsack problem by transforming the service requester s requirements into constraints.针对现有W eb服务组合方法对服务质量(QoS)贪婪索取而不利于网格资源有效利用的问题,提出基于商品市场的"按需"网格服务选择方法:根据面向工作流全局的评价模型,以服务使用者需求为约束条件,将服务选择建模为0-1多维背包问题;并引入经济学中的"价格—供需关系"改进了服务选择模型。
延伸阅读
背包行军或外出时背(bēi)在背上的衣被包裹。
