找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Advances in Swarm Intelligence; 7th International Co Ying Tan,Yuhui Shi,Li Li Conference proceedings 2016 Springer International Publishing

[复制链接]
楼主: irritants
发表于 2025-3-26 21:37:27 | 显示全部楼层
发表于 2025-3-27 01:57:22 | 显示全部楼层
On-Orbit Servicing Mission Planning for Multi-spacecraft Using CDPSO optimization (CDPSO) algorithm is applied according to the characteristics of multi-spacecraft collaborative mission planning problem. We design the new update formulae of position and velocity of the particles for the OOS optimization mission. By analyzing the critical index factors which contain
发表于 2025-3-27 05:31:39 | 显示全部楼层
Solving the Test Task Scheduling Problem with a Genetic Algorithm Based on the Scheme Choice Rulech combines a genetic algorithm with a new rule for scheme selection is adopted to find optimal solutions. GASCR is a hierarchal approach based on the characteristics of TTSP because the given problem can be decomposed into task sequence and scheme choice. GA with the non-Abelian (Nabel) crossover a
发表于 2025-3-27 11:08:50 | 显示全部楼层
发表于 2025-3-27 17:22:52 | 显示全部楼层
发表于 2025-3-27 20:35:17 | 显示全部楼层
Solving Flexible Job-Shop Scheduling Problem with Transfer Batches, Setup Times and Multiple Resourcducts. However, Flexible Job-shop Scheduling is really challenging and even more complex when setup times, transfer batches and multiple resources are added. In this paper, we present an application of dispatching algorithm for the Flexible Job-shop Scheduling Problem (FJSP) presented in this indust
发表于 2025-3-27 23:46:48 | 显示全部楼层
发表于 2025-3-28 05:31:10 | 显示全部楼层
发表于 2025-3-28 08:17:07 | 显示全部楼层
An Improved Ensemble Extreme Learning Machine Based on ARPSO and Tournament-Selectionperformance and simple setting. However, how to select and cluster the candidate are still the most important issues. In this paper, KGA-ARPSOELM, an improved ensemble of ELMs based on K-means, tournament-selection and attractive and repulsive particle swarm optimization (ARPSO) strategy is proposed
发表于 2025-3-28 14:30:32 | 显示全部楼层
An Improved LMDS AlgorithmS (LMDS) is a fast algorithm of CMDS. In LMDS, some data points are designated as landmark points. When the intrinsic dimension of the landmark points is less than the intrinsic dimension of the data set, the embedding recovered by LMDS is not consistent with that of classical multidimensional scali
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-22 02:41
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表