dc.contributor |
Genetic and Evolutionary Computation Conference (GECCO) <Chicago, 2003> |
de_DE |
dc.contributor.author |
Krasnogor, Natalio |
de_DE |
dc.contributor.author |
Gustafson, Steven |
de_DE |
dc.date.accessioned |
2003-09-02 |
de_DE |
dc.date.accessioned |
2014-03-17T11:32:57Z |
|
dc.date.available |
2003-09-02 |
de_DE |
dc.date.available |
2014-03-17T11:32:57Z |
|
dc.date.issued |
2003 |
de_DE |
dc.identifier.other |
107331012 |
de_DE |
dc.identifier.uri |
http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-9013 |
de_DE |
dc.identifier.uri |
http://hdl.handle.net/10900/43969 |
|
dc.description.abstract |
In this paper we implement a Self-Generating Memetic Algorithm for the
Maximum Contact Overlap Problem (MAX-CMO). We demonstrate how the optimization of
solutions can be done simultaneously with the discovering of useful local
search strategies. In turn, the evolved local searchers act as suppliers of
building blocks for the evolutionary algorithm. |
en |
dc.language.iso |
en |
de_DE |
dc.publisher |
Universität Tübingen |
de_DE |
dc.rights |
ubt-nopod |
de_DE |
dc.rights.uri |
http://tobias-lib.uni-tuebingen.de/doku/lic_ubt-nopod.php?la=de |
de_DE |
dc.rights.uri |
http://tobias-lib.uni-tuebingen.de/doku/lic_ubt-nopod.php?la=en |
en |
dc.subject.classification |
Memetischer Algorithmus |
de_DE |
dc.subject.ddc |
510 |
de_DE |
dc.subject.other |
Memetic Algorithms , Maximum Contact Overlap Problem , Building Blocks |
en |
dc.title |
The Local Searcher as a Supplier of Building Blocks in Self-generating Memetic Algorithms |
en |
dc.type |
ConferenceObject |
de_DE |
utue.publikation.fachbereich |
Sonstige/Externe |
de_DE |
utue.publikation.fakultaet |
9 Sonstige / Externe |
de_DE |
dcterms.DCMIType |
Text |
de_DE |
utue.publikation.typ |
conferenceObject |
de_DE |
utue.opus.id |
901 |
de_DE |
utue.opus.portal |
woma4 |
de_DE |
utue.opus.portalzaehlung |
0.00000 |
de_DE |