Design of a parallel genetic algorithm for the Internet
Pourquoi ce travail est-il dans la base ?
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Le tri à trois modèles
les 1 000 travaux triés →Les trois modèles l'ont jugé hors champ.
Design of a parallel genetic algorithm; a computational tool for optimization, not a study of research practice.
It develops a computational algorithm for optimization rather than studying research methods or practice.
Computer science algorithm design for parallel genetic algorithms, not metaresearch on how research is done.
Résumé
This paper proposes a parallel implementation of the genetic algorithm (GA) on the Internet which will improve the algorithm's performance. It is motivated by the possibility of aiding research into complex search and optimization problems that use the GA. Requirements and constraints regarding parallelization of the GA are identified. A parallel GA is developed for an ideal PRAM architecture and is shown to have an asymptotic running time of O(log n), an improvement over the sequential GA. A parallel GA is also designed for a Unix network and has an asymptotic running time comparable to the ideal system. The algorithm is a decentralized, asynchronous, and fault-tolerant design that matches the characteristics of the network. The GA population is divided into colonies that are distributed among processors. Trade policies are executed for the exchange of genes.
Conservé avec la notice de tri, où il sert de preuve aux étiquettes ci-dessus.
La notice
- Revue
- Thématique
- Evolutionary Algorithms and Applications
- Domaine
- Computer Science
- Établissements canadiens
- University of Manitoba
- Organismes subventionnaires
- —
- Mots-clés
- Computer scienceUnixGenetic algorithmAsynchronous communicationParallel computingParallel algorithmIdeal (ethics)PopulationThe InternetFault toleranceDistributed computingAlgorithmComputer networkOperating system
- Résumé présent dans OpenAlex
- oui