您要查找的是不是:
- Knapsack problem is a typical NP complete problem. 背包问题是一个典型的np完全问题。
- The code for international call is zero one zero(010). 国际电话的代码为010。
- By introducing the transformative knapsack problem into the scheme, the security of new scheme one is strengthened. 通过引入变形的背包问题,新方案一的安全性进一步提高。
- The function optimization and knapsack problem show the effectiveness of PEA. 函数优化和背包问题实验验证了PEA的有效性。
- He stood, swung one knapsack onto his left shoulder, put the other on top of his cooler. 他站着,把一个背包甩到左肩,另一个放在冷藏箱上。
- I will repeat, that the above method is for EAs working only on closed bars, i.e. on all bars except the zero one! 我再说一遍,认为上述方法是紧急救护服务工作,只关闭了酒吧,即对所有酒吧除零!
- A new approximation algorithm is presented for the classical0-1 knapsack problem in this paper. 运用属性论的转换程度函数,结合贪婪算法和核问题的研究思路提出了多维0-1背包问题的一种新型近似解法。
- Our patented vector thrust coil gives the zero one Versatran the ability to sustain normal flight in the event of a catastrophic multi engine failure. Versatran拥有专利的矢量推力线圈技术,即使在发动机失去作用时一样能使杰罗万制造的飞车正常飞行。
- An optimization algorithm for multiple-choice knapsack problem based on ant colony system is presented. 提出了一种用蚁群系统求解多选择背包问题的优化算法。
- Right. It was so exciting. Phelps won his seventh gold medal with point zero one second difference. Point zero one second, can you image it? . 没错。真是太刺激了。菲尔普斯以零点零一秒之差赢得了第七面金牌。零点零一秒耶,你想像得到吗?
- 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背包问题。
- The 0/1 knapsack problem is a well known combinatorial problem which is NP-Complete. 摘要0/1背包问题是一类典型的组合优化问题,且属于NP完全问题。
- I have written a knapsack problem of the greedy algorithm, a very good learning tool. 自己编写的一个背包问题的贪心算法,很好的学习工具。
- Knapsack problem is a famous NPC problem, there is no effective method to solve this question at present. 背包问题是一个NP完全问题,目前还没有解决这一问题的非常有效的方法。
- This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem. 提出了0-1多项式背包问题的一种新的精确算法。
- The NP-Completeness of them is proven by reduction from the well known KNAPSACK problem. 用整数背包问题具体证明了这两个问题的NP-完备性。
- Transform the model into a classic unbounded knapsack problem and present a dynamic programming algorithm to solve it. 对此模型用动态规划的方法进行求解,得到了测试用例的最优分配方案;
- Discusses the classical knapsack problem applies the genetic algorithm to solve the problem. 对决策优化的经典背包问题进行了研究,提出了应用遗传算法对该模型进行求解。
- Memetic algorithm is one of heuristic algorithms,it is more appropriate for multidimensional knapsack problems than some classical mathematical methods. 文化基因算法是一种启发式算法,与一些经典数学方法相比,更适于求解多约束背包问题。
- The experiment results of the knapsack problem and multiuser detection problem show that the both of the propos... 通过对0-1背包问题和多用户检测问题的求解表明,新的算法不仅操作更简单,而且全局搜索能力有了显著的提高。