找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 紀(jì)念性
31#
發(fā)表于 2025-3-26 21:16:13 | 只看該作者
32#
發(fā)表于 2025-3-27 02:45:27 | 只看該作者
33#
發(fā)表于 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.
34#
發(fā)表于 2025-3-27 11:27:43 | 只看該作者
35#
發(fā)表于 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
36#
發(fā)表于 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
37#
發(fā)表于 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
38#
發(fā)表于 2025-3-28 04:15:31 | 只看該作者
39#
發(fā)表于 2025-3-28 10:11:29 | 只看該作者
40#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-24 14:45
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
雅江县| 称多县| 定南县| 永昌县| 利津县| 凉城县| 阿巴嘎旗| 忻州市| 乌拉特前旗| 罗城| 金坛市| 三都| 疏附县| 赤峰市| 彭山县| 伊通| 沙湾县| 吴忠市| 金阳县| 九龙城区| 曲沃县| 商丘市| 成武县| 綦江县| 襄垣县| 伊通| 南乐县| 西安市| 樟树市| 安图县| 昌平区| 海城市| 永德县| 于田县| 白朗县| 益阳市| 井冈山市| 张家界市| 吉隆县| 应用必备| 无锡市|