Parallel evolutionary algorithms : a review
Adamidis, Panagiotis/ Αδαμίδης, Παναγιώτης
Institution and School/Department of submitter: | ΤΕΙ Θεσσαλονίκης |
Keywords: | EAs (Evolutionary algorithms);Αλγόριθμος;Γενετικές έρευνες (Αλγόριθμοι);Τεχνικές εφαρμογής;Implementation techniques;Genetic searches (Algorithms);Algorism;PEAs (Parallel Evolutionary Algorithms);PEAs (Παράλληλοι Εξελικτικοί Αλγόριθμοι);EAs (Εξελικτικοί αλγόριθμοι) |
Issue Date: | Sep-1998 |
Citation: | Adamidis P. (1998). Parallel evolutionary algorithms: A review. University of Macedonia. Sept 24-26, 1998: Greece Hellenic-European Conference on Computer Mathematics and its Applications, Athens, 1998 Hellenic-European Conference on Computer Mathematics and its Applications, Athens, 1998 |
Abstract: | During recent years the area of Evolutionary Algorithms (EAs) in general and the field of Parallel Evolutionary Algorithms (PEA) in particular has matured up to a point, where the application to a complex real-world problem in some applied science is now potentially feasible and to the benefit of both fields. The availability of faster and cheaper parallel computers makes it possible to apply EAs to large populations and very complex populations. This paper presents a review of current implementation techniques for EAs on parallel hardware |
Description: | Δημοσιεύσεις μελών--ΣΤΕΦ--Τμήμα Μηχανικών Πληροφορικής, 1998 |
URI: | http://195.251.240.227/jspui/handle/123456789/10377 |
Other Identifiers: | http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.57.2962&rep=rep1&type=pdf |
Appears in Collections: | Δημοσιεύσεις σε Περιοδικά |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Adamidis_Panagiotis_Parallel_Evolutionary_Algorithms_A_Review.pdf | 56.1 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
This item is a favorite for 0 people.
http://195.251.240.227/jspui/handle/123456789/10377
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.