نتایج جستجو برای: cat swarm optimization

تعداد نتایج: 359721  

Journal: :International Journal of Computational Intelligence Systems 2020

Journal: :Biomimetics 2023

In large datasets, irrelevant, redundant, and noisy attributes are often present. These can have a negative impact on the classification model accuracy. Therefore, feature selection is an effective pre-processing step intended to enhance performance by choosing small number of relevant or significant features. It important note that due NP-hard characteristics selection, search agent become tra...

Journal: :Computer systems science and engineering 2023

About 170 nations have been affected by the COvid VIrus Disease-19 (COVID-19) epidemic. On governing bodies across globe, a lot of stress is created COVID-19 as there continuous rise in patient count testing positive, and they feel challenging to tackle this situation. Most researchers concentrate on data analysis using machine learning paradigm these situations. In previous works, Long Short-T...

Journal: :International Journal of Advanced Computer Science and Applications 2023

Recently, cloud computing has gained recognition as a powerful tool for providing clients with flexible platforms, software services, and cost-effective infrastructures. Cloud is form of distributed that allows users to store process data in virtual environment instead physical server. This beneficial because it businesses quickly scale up or down their capacity, reducing the need invest expens...

2014
Lakshman Pappula Debalina Ghosh

This paper presents a novel technique for the synthesis of unequally spaced linear antenna array. The modified Invasive Weed Optimization (IWO) algorithm is applied to optimize the antenna element positions for suppressing peak side lobe level (PSLL) and for achieving nulls in specified directions. The novelty of the proposed approach is in the application of a constraint-based static penalty f...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی (نوشیروانی) بابل - دانشکده مهندسی برق و کامپیوتر 1393

مسئله ی یافتن کلیک بیشینه گراف maximum clique problem (mcp)، از جمله مسائل np-complete است که به یافتن بزرگترین زیرگراف کامل در یک گراف ساده اشاره دارد و در موارد متنوعی از جمله نظریه کدگذاری، هندسه و شبکه های اجتماعی کاربرد دارد. در این پژوهش الگوریتمی ترکیبی برای حل مسئله ی کلیک بیشینه گراف پیشنهاد شده است. این الگوریتم ترکیبی از یک روش حریصانه ابتکاری و الگوریتم های مبتنی بر هوش جمعی بهینه س...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید