Description: 利用分治策略,提出一种基于SIMD共享存储计算机模型的并行背包问题求解算法.算法允许使用O(2n/4)1− ε个并行处理机单元,0≤≤ε1,O(2n/2)个存储单元,在O(2n/4(2n/4)ε)时间内求解n维背包问题,算法的成本为O(2n/2).将提出的算法与已有文献结论进行对比表明,该算法改进了已有文献的相应结果,是求解背包问题的成本最优并行算法.同时还指出了相关文献主要结论的错误.-The use of sub-rule strategy, a shared memory based on the SIMD model of parallel computer algorithm knapsack problem. Algorithm allows the use of O (2n/4) 1-ε of parallel processor units, 0 ≤ ≤ ε1, O (2n/2 ) a memory cell, in the O (2n/4 (2n/4) ε) time for solving n-dimensional knapsack problem, algorithm of cost O (2n/2). the proposed algorithm with the existing literature shows that the conclusions, The algorithm improves the corresponding results of the literature is the cost of solving the knapsack problem the optimal parallel algorithm. At the same time, also pointed out that the main conclusions of the relevant literature mistake. Platform: |
Size: 313344 |
Author:王祁 |
Hits:
Description: 背包问题的最优并行算法,毕业设计,利用分治策略-Knapsack problem of the optimal parallel algorithm, graduation design, the use of sub-rule strategy Platform: |
Size: 313344 |
Author:syzqgj |
Hits:
Description: o-1 knapsack parallel implementaion in c,
Begining socket pro in c.zip,
rsa using crt in c,
des in java,
fuzzy string matching in c-o-1 knapsack parallel implementaion in c,
Begining socket pro in c.zip,
rsa using crt in c,
des in java,
fuzzy string matching in c++ Platform: |
Size: 13312 |
Author:srinath |
Hits:
Description: 基于采样和MIMD结构的背包问题并行算法.pdf讲的很好很详细!初学并行算法的朋友可以看一下!-Structure based on sampling and MIMD parallel algorithm knapsack problem. Pdf is more about good! Parallel algorithm beginner friends can see it! Platform: |
Size: 164864 |
Author:蜗牛龙 |
Hits:
Description: 用禁忌搜索解决0-1背包问题,及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data Platform: |
Size: 5421056 |
Author:cmn |
Hits:
Description: vc++中用以测试mpi并行的遗传算法,应用在0-1背包的问题中。-Vc++ is used to test the mpi parallel genetic algorithm (ga), used in 0-1 knapsack problem. Platform: |
Size: 1024 |
Author:匡荣 |
Hits: