0/1背包问题竞争决策算法 2. Based on mathematical inference, this paper proposes a quick reduction algorithm for0/1-knapsack problem. 用数学方法分析了0/1背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优解中的物品和成批排除一定不在最优解中的物品。
单词0/1 背包问题 释义0/1 背包问题0/1 knapsack problem 英汉汉英词典包含3953260条英汉及汉英翻译词条,涵盖了常用英语单词及词组短语的翻译及用法,是英语学习的必备工具。
针对现有W eb服务组合方法对服务质量(QoS)贪婪索取而不利于网格资源有效利用的问题,提出基于商品市场的"按需"网格服务选择方法:根据面向工作流全局的评价模型,以服务使用者需求为约束条件,将服务选择建模为0-1多维背包问题;并引入经济学中的"价格—供需关系"改进了服务选择模型。5...
0/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背包问题的特性,提出了一个快速降价算法,该算法能成批确定一定在最优...
0-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多维背包问题 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多维背包问题 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多选择背包问题2) multiple-choice knapsack problem 多选择背包问题 1. Then, advanced a modified differential evolution algorithm (MDEA) for multiple-choice knapsack problem (MCKP) over discrete space, which use individual positive coding method and combine with the subtle adjusting strategy of ...