找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Intelligence in Data Mining - Volume 1; Proceedings of the I Lakhmi C. Jain,Himansu Sekhar Behera,Durga Prasad Conference pr

[复制链接]
楼主: 纪念性
发表于 2025-3-26 21:16:13 | 显示全部楼层
发表于 2025-3-27 02:45:27 | 显示全部楼层
发表于 2025-3-27 07:30:49 | 显示全部楼层
https://doi.org/10.1007/978-1-4684-0023-6em objective while considering both the real and reactive as a sub problem. The proposed method is used for solving the non-linear optimization problems while minimizing the objective voltage stability margin is also maintained. The proposed technique is tested on IEEE 57 bus system.
发表于 2025-3-27 11:27:43 | 显示全部楼层
发表于 2025-3-27 16:39:00 | 显示全部楼层
Mikael Søndergaard,Dorthe Døjbakrforming communication between them becomes difficult. In multi mobile agent environment, a reliable communication is still a big challenge. In this paper, we have addressed the pros and cons of the existing different Mobile Agent communication protocols with their limitations. This paper also prese
发表于 2025-3-27 17:46:19 | 显示全部楼层
Martha A. Gephart,Victoria J. Marsickllection, tracking the vehicle’s route. It is more challenging to automate the identification of Indian vehicles by using it’s number plates. The font type and font size of the letters used randomly, the dealer’s logo or other artefacts may be available on the plate. In this proposed algorithm it is
发表于 2025-3-27 22:41:47 | 显示全部楼层
https://doi.org/10.1007/978-3-8349-9459-2ons of the intensities and the information about relative positions of neighboring pixels of an image. GLCM matrices are calculated corresponding to different orientation (0, 45, 90, 135) with four different offset values. After the calculation of GLCMs, each GLCM is divided into 32 × 32 sub-matrice
发表于 2025-3-28 04:15:31 | 显示全部楼层
发表于 2025-3-28 10:11:29 | 显示全部楼层
发表于 2025-3-28 12:05:35 | 显示全部楼层
https://doi.org/10.1007/978-3-642-22209-2have been used for clustering task. The Cat Swarm Optimization (CSO) is the latest meta-heuristic algorithm which has been applied in clustering field and provided better results than K-Means and Particle Swarm Optimization (PSO). However, this algorithm is suffered with diversity problem. To overco
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 05:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表