Asynchronous genetic algorithms for heterogeneous networks using coarse-grained dataflow

DOI10.1007/3-540-45105-6_88MaRDI QIDQ4436896zbMATH OpenFDO

Authors John W. jun. Baugh, Sujay V. Kumar

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2723/27230730.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 759412
• Scalable parallel genetic algorithms
• Heterogeneous computing and parallel genetic algorithms.
• Understanding Simple Asynchronous Evolutionary Algorithms
• Improved genetic algorithm for the permutation flowshop scheduling problem.

Cited in

(4)

• Asynchronous superimposition mechanisms of concurrent competitive waves for hyper-distributed hyper-parallel heuristic problem solving
• Asynchronous heterogeneous mechanism for hyper-distributed hyper-parallel AI processing
• A general framework to understand parallel performance in heterogeneous clusters: analysis of a new adaptive parallel genetic algorithm
• A Dynamic Multi Agent-Based Approach to Parallelizing Genetic Algorithm

This page was built for publication: Asynchronous genetic algorithms for heterogeneous networks using coarse-grained dataflow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436896)