![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Parallel Evolutionary Computations 2006
- Nadia Nedjah, Luiza de Macedo Mourelle, Enrique Alba:
Parallel Evolutionary Computations. Studies in Computational Intelligence 22, Springer 2006, ISBN 978-3-540-32837-7 - Hernán E. Aguirre, Kiyoshi Tanaka:
A Model for Parallel Operators in Genetic Algorithms. 3-31 - Francisco Luna
, Antonio J. Nebro
, Enrique Alba
:
Parallel Evolutionary Multiobjective Optimization. 33-56 - Nadia Nedjah
, Luiza de Macedo Mourelle
:
A Reconfigurable Parallel Hardware for Genetic Algorithms. 59-69 - Miguel A. Vega-Rodríguez
, Juan Antonio Gómez Pulido
, Juan Manuel Sánchez-Pérez, José M. Granado Criado
, Manuel Rubio del Solar:
Reconfigurable Computing and Parallelism for Implementing and Accelerating Evolutionary Algorithms. 71-93 - Enrique Alba
, Gabriel Luque
:
Performance of Distributed GAs on DNA Fragment Assembly. 97-115 - Nouredine Melab, El-Ghazali Talbi, Sébastien Cahon:
On Parallel Evolutionary Algorithms on the Computational Grid. 117-132 - Tien-Tsin Wong, Man Leung Wong
:
Parallel Evolutionary Algorithms on Consumer-Level Graphics Processing Unit. 133-155 - Shu-Chuan Chu
, Jeng-Shyang Pan
:
Intelligent Parallel Particle Swarm Optimization Algorithms. 159-175 - Daniel Chu, Albert Y. Zomaya
:
Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model. 177-198
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.