Analyzing synchronous and asynchronous parallel distributed genetic algorithms
From MaRDI portal
Publication:4538531
DOI10.1016/S0167-739X(99)00129-6zbMath1016.68177OpenAlexW2105451315WikidataQ127360192 ScholiaQ127360192MaRDI QIDQ4538531
Publication date: 14 July 2002
Published in: Future Generation Computer Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-739x(99)00129-6
Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Related Items (6)
Performance comparison of memetic algorithms ⋮ Continuous adjoint methods for turbulent flows, applied to shape and topology optimization: industrial applications ⋮ ON THE BEHAVIOR OF PARALLEL GENETIC ALGORITHMS FOR OPTIMAL PLACEMENT OF ANTENNAE IN TELECOMMUNICATIONS ⋮ Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models ⋮ A robust parallel algorithm of the particle swarm optimization method for large dimensional engineering problems ⋮ Parallel evolutionary algorithms can achieve super-linear performance
Uses Software
This page was built for publication: Analyzing synchronous and asynchronous parallel distributed genetic algorithms
