Parallel algorithms for solving combinatorial macromodelling problems

Volodymyr STEPASHKO; Serhiy YEFIMENKO

首页> 外文期刊>Przeglad Elektrotechniczny >Parallel algorithms for solving combinatorial macromodelling problems

【24h】

Parallel algorithms for solving combinatorial macromodelling problems

机译：解决组合宏建模问题的并行算法

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

The scheme of combinatorial algorithm with successive complication of structures is proposed. Test experiments of solving the problem of structural and parametrical identification on the cluster system scit-3 showed that the use of this scheme provides the uniform load of all processors of the cluster.

机译：提出了结构连续复杂的组合算法方案。解决集群系统scit-3上的结构和参数识别问题的测试实验表明，使用此方案可为集群的所有处理器提供均匀的负载。

著录项

来源
《Przeglad Elektrotechniczny》 |2009年第4期|98-99|共2页
作者
Volodymyr STEPASHKO; Serhiy YEFIMENKO;
展开▼
作者单位

International Research and Training Centre of Information Technologies and Systems of the National Academy of Sciences and Ministry of Education and Sciences of Ukraine;

International Research and Training Centre of Information Technologies and Systems of the National Academy of Sciences and Ministry of Education and Sciences of Ukraine;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
GMDH combinatorial algorithm; parallel computing; cluster system; successive complication;

机译：GMDH组合算法;并行计算;集群系统连续并发症;

相似文献

外文文献
中文文献
专利

1. Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems [J] . Jing Tang, Meng Hiot Lim, Yew Soon Ong Soft Computing . 2007,第9期

机译：解决大规模组合优化问题的分集自适应并行模因算法
2. Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems [J] . Tang J, Lim MH, Ong YS Soft computing: A fusion of foundations, methodologies and applications . 2007,第9期

机译：解决大规模组合优化问题的分集自适应并行模因算法
3. Searching for Backbones―a high-performance parallel algorithm for solving combinatorial optimization problems [J] . Johannes Schneider Future generation computer systems . 2003,第1期

机译：搜索主干-一种解决组合优化问题的高性能并行算法
4. Solving combinatorial optimization problems using parallel simulated annealing and parallel genetic algorithms [C] . Pooja P. Mutalik, Leslie R. Knight, Joe L. Blanton, ACM/SIGAPP symposium on Applied computing . 1992

机译：使用并行模拟退火和并行遗传算法解决组合优化问题
5. Combinatorial and Stochastic Approach to Parallelization of the Kangaroo Method of Solving the Discrete Logarithm Problem [D] . Klesczewski, Joseph. 2021

机译：求解离散对数问题的袋鼠方法并行化的组合与随机方法
6. Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2n) [O] . Kenli Li, Shuting Zou, Jin Xv 2008

机译：基于DNA的快速并行分子算法：求解GF（2n）上的椭圆曲线离散对数问题
7. Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU [O] . Eduardo Cárdenas Gómez, Roberto Poveda Chaves, Orlando García Hurtado 2018

机译：通过通过GPU的并行遗传算法使用二次分配问题（QAP）解决方案来解决组合优化NP-Illation问题
8. Significance of Problem Solving Parameters on the Performance of Combinatorial Algorithms on Multi-Computer Parallel Architectures [R] . McCormack, W. M., Gray, F. G., Haralick, R. M. 1982

机译：求解参数对多机并行结构组合算法性能的意义

Parallel algorithms for solving combinatorial macromodelling problems

摘要

著录项

相似文献

相关主题

期刊订阅