首页> 外文OA文献 >Teams of global equilibrium search algorithms for solving weighted MAXIMUM CUT problem in parallel
【2h】

Teams of global equilibrium search algorithms for solving weighted MAXIMUM CUT problem in parallel

机译:全局均衡搜索算法团队可并行解决加权最大切割问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper, we investigate the impact of communication between optimization algorithms running in parallel. In particular we focus on the weighted maximum cut (WMAXCUT) problem and compare different communication strategies between teams of GES algorithms running in parallel. The results obtained by teams encourage the development of team algorithms. They were significantly better than the algorithmic portfolio (no communication) approach and suggest that the communication between algorithms running in parallel is a promising research direction.
机译:在本文中,我们研究了并行运行的优化算法之间通信的影响。特别是,我们关注加权最大割(WMAXCUT)问题,并比较并行运行的GES算法团队之间的不同通信策略。团队获得的结果鼓励了团队算法的发展。它们明显优于算法组合(无通信)方法,并表明并行运行的算法之间的通信是有前途的研究方向。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号