Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66749
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Relational implementation of simple parallel evolutionary algorithms |
Author: | Kehden, B. Neumann, F. Berghammer, R. |
Citation: | Relational Methods in Computer Science : 8th International Seminar on Relational Methods in Computer Science, 3rd International Workshop on Applications of Kleene Algebra and Workshop of COST Action 274: TARSKI : St. Catharines, ON, Canada, February 22-26, 2005 : Selected Revised Papers / W. MacCaull, M. Winter, I. Düntsch (eds.), pp.161-172 |
Publisher: | Springer-Verlag Berlin |
Publisher Place: | Heidelberger Platz 3 Berlin Germany D-14197 |
Issue Date: | 2006 |
Series/Report no.: | LECTURE NOTES IN COMPUTER SCIENCE |
ISBN: | 3540333398 9783540333395 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | International Seminar on Relational Methods in Computer Science (8th : 2005 : St Catharines, Ontario, Canada) |
Editor: | MacCaull, W. Winter, M. Duntsch, I. |
Statement of Responsibility: | Britta Kehden, Frank Neumann, and Rudolf Berghammer |
Abstract: | Randomized search heuristics, among them evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to hard problems in combinatorial optimization to get near-optimal solutions. We present a new approach implementing simple parallel evolutionary algorithms by relational methods. Populations are represented as relations which are implicitly encoded by (reduced, ordered) binary decision diagrams. Thereby, the creation and evaluation is done in parallel, which increases efficiency considerably. |
Rights: | © Springer-Verlag Berlin Heidelberg 2006 |
DOI: | 10.1007/11734673 |
Published version: | https://doi.org/10.1007/11734673 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.