Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Neural and Evolutionary Computing

arXiv:cs/0402049 (cs)
[Submitted on 20 Feb 2004]

Title:An architecture for massive parallelization of the compact genetic algorithm

Authors:Fernando G. Lobo, Claudio F. Lima, Hugo Martires
View PDF
Abstract: This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The resulting scheme has three major advantages. First, it has low synchronization costs. Second, it is fault tolerant, and third, it is scalable.
The paper argues that the benefits that can be obtained with the proposed approach is potentially higher than those obtained with traditional parallel genetic algorithms. In addition, the ideas suggested in the paper may also be relevant towards parallelizing more complex probabilistic model building genetic algorithms.
Comments: 12 pages, submitted to gecco 2004
Subjects: Neural and Evolutionary Computing (cs.NE)
ACM classes: C.1.4; G.1.6; I.2.8
Cite as: arXiv:cs/0402049 [cs.NE]
  (or arXiv:cs/0402049v1 [cs.NE] for this version)
  https://doi.org/10.48550/arXiv.cs/0402049

Submission history

From: Fernando Lobo [view email]
[v1] Fri, 20 Feb 2004 16:36:20 UTC (18 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.NE
< prev   |   next >
new | recent | 2004-02

References & Citations

DBLP - CS Bibliography

listing | bibtex
Fernando G. Lobo
Cláudio F. Lima
Hugo Martires
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)