क्यूआर कोड

Boolean Particle Swarm Optimization with 0-Mutation

First introduced in 1995, the Particle Swarm Optimization (PSO) algorithm offers a reliable and efficient solution to real-valued optimization problems. However, extending it to binary-valued problems proved challenging. This paper proposes a new Boolean version of the PSO technique based on a novel...

पूर्ण विवरण

में बचाया:
मुख्य लेखकों: Zaharias D. Zaharis, Emmanouil Georgios Nikopolitidis, Pavlos I. Lazaridis, Panagiotis Sarigiannidis, Sotirios K. Goudos
स्वरूप: Artigo
भाषा:Inglês
प्रकाशित: MDPI AG 2026-05-01
श्रृंखला:Machine Learning and Knowledge Extraction
विषय:
particle swarm optimization
binary PSO
boolean PSO
mutation
antenna design
array thinning
ऑनलाइन पहुंच:https://www.mdpi.com/2504-4990/8/5/123
टैग: टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन