找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Evolutionary Computation in Combinatorial Optimization; 11th European Confer Peter Merz,Jin-Kao Hao Conference proceedings 2011 Springer Be

[复制链接]
楼主: 粗略
发表于 2025-3-26 21:07:12 | 显示全部楼层
Evolutionary Computation in Combinatorial Optimization978-3-642-20364-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-27 01:40:12 | 显示全部楼层
https://doi.org/10.1057/9780333981733tions, and two local search schemes to enhance its performance for the MOUCTP. The experimental results based on a set of test problems show that the proposed algorithm is efficient for solving the MOUCTP.
发表于 2025-3-27 07:15:39 | 显示全部楼层
发表于 2025-3-27 11:41:25 | 显示全部楼层
发表于 2025-3-27 16:21:09 | 显示全部楼层
发表于 2025-3-27 19:18:12 | 显示全部楼层
Tom Dyson,Theodore Konstadinidesocess. This paper presents a new methodology to design and implement efficiently GPU-based multiobjective local search algorithms. The experimental results show that the approach is promising especially for large problem instances.
发表于 2025-3-27 22:20:07 | 显示全部楼层
发表于 2025-3-28 02:31:57 | 显示全部楼层
发表于 2025-3-28 06:45:55 | 显示全部楼层
发表于 2025-3-28 14:26:06 | 显示全部楼层
Experiments in Parallel Constraint-Based Local Search, manner, that is, each process is an independent search engine and there is no communication between the simultaneous computations. Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 02:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表