An architecture for massive parallelization of the compact genetic algorithm
| dc.creator | Lobo, Fernando G. | |
| dc.creator | Lima, Claudio F. | |
| dc.creator | Martires, Hugo | |
| dc.date | 2004-02-20 | |
| dc.date.accessioned | 2026-07-07T03:20:56Z | |
| dc.date.available | 2026-07-07T03:20:56Z | |
| dc.description | 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. | |
| dc.description | 12 pages, submitted to gecco 2004 | |
| dc.identifier | https://arxiv.org/abs/cs/0402049 | |
| dc.identifier | http://arxiv.org/abs/cs/0402049 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32012 | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | C.1.4; G.1.6; I.2.8 | |
| dc.title | An architecture for massive parallelization of the compact genetic algorithm | |
| dc.type | text |