找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Swarm, Evolutionary, and Memetic Computing; 4th International Co Bijaya Ketan Panigrahi,Ponnuthurai Nagaratnam Suga Conference proceedings

[复制链接]
楼主: ARGOT
发表于 2025-3-28 17:08:42 | 显示全部楼层
Real-Coded Genetic Algorithm and Fuzzy Logic Approach for Real-Time Load-Tracking Performance of ansimulation of the investigated power system model reveals that the proposed RGA-SFL yields on-line, off-nominal controller parameters, resulting in on-line terminal voltage response. To show the efficiency and effectiveness of RGA, binary coded genetic algorithm is taken for the sake of comparison.
发表于 2025-3-28 20:45:46 | 显示全部楼层
发表于 2025-3-28 23:48:07 | 显示全部楼层
发表于 2025-3-29 06:03:31 | 显示全部楼层
Sandholm Algorithm with K-means Clustering Approach for Multi-robot Task Allocation,earchers concentrate only on minimizing the distance between the robots and the targets, and not much importance is given to the balancing of workloads among robots. Auction based mechanism are popularly used to allocate tasks to multiple robots. This paper attempts to develop mechanisms to address
发表于 2025-3-29 08:38:08 | 显示全部楼层
发表于 2025-3-29 12:47:32 | 显示全部楼层
Non-fragile Robust PI Controller Design Using Co-variance Matrix Adaptation Evolutionary Strategy,ed maximum sensitivity of the closed loop system is considered as an objective and success rate of stability under probabilistic controller uncertainty is taken as a constraint for non-fragile robust PI controller design problem. Success rate of stability is calculated using Monte Carlo simulation (
发表于 2025-3-29 16:06:17 | 显示全部楼层
Meta Heuristic Approaches for Circular Open Dimension Problem,predetermined width and variable length. The circle packing problem is one of the variant of cutting and packing problems. We propose four different nature inspired Meta heuristic algorithms for solving this problem. These algorithms are proved to be the best in finding local solutions. The algorith
发表于 2025-3-29 21:22:48 | 显示全部楼层
发表于 2025-3-30 00:54:10 | 显示全部楼层
发表于 2025-3-30 07:04:12 | 显示全部楼层
An Ant Colony Optimization Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem,e of least cost in which every non-leaf node have a degree of at least . in the spanning tree. This problem is .-Hard for . where . is the number of nodes in the graph. In this paper, we have proposed an ant colony optimization based approach to this problem. The proposed approach has been tested on
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-7 08:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表