Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66749
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kehden, B. | - |
dc.contributor.author | Neumann, F. | - |
dc.contributor.author | Berghammer, R. | - |
dc.contributor.editor | MacCaull, W. | - |
dc.contributor.editor | Winter, M. | - |
dc.contributor.editor | Duntsch, I. | - |
dc.date.issued | 2006 | - |
dc.identifier.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 | - |
dc.identifier.isbn | 3540333398 | - |
dc.identifier.isbn | 9783540333395 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/2440/66749 | - |
dc.description.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. | - |
dc.description.statementofresponsibility | Britta Kehden, Frank Neumann, and Rudolf Berghammer | - |
dc.language.iso | en | - |
dc.publisher | Springer-Verlag Berlin | - |
dc.relation.ispartofseries | LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.rights | © Springer-Verlag Berlin Heidelberg 2006 | - |
dc.source.uri | https://doi.org/10.1007/11734673 | - |
dc.title | Relational implementation of simple parallel evolutionary algorithms | - |
dc.type | Conference paper | - |
dc.contributor.conference | International Seminar on Relational Methods in Computer Science (8th : 2005 : St Catharines, Ontario, Canada) | - |
dc.identifier.doi | 10.1007/11734673 | - |
dc.publisher.place | Heidelberger Platz 3 Berlin Germany D-14197 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Neumann, F. [0000-0002-2721-3618] | - |
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.