Theoretical Aspects of Evolutionary Algorithms
| dc.contributor.author | Wegener, Ingo | de |
| dc.date.accessioned | 2004-12-07T08:20:51Z | |
| dc.date.available | 2004-12-07T08:20:51Z | |
| dc.date.created | 2001 | de |
| dc.date.issued | 2001-10-30 | de |
| dc.description.abstract | Randomized search heuristics like simulated annealing and evolutionary algorithms are applied successfully in many different situations. However, the theory on these algorithms is still in its infancy. Here it is discussed how and why such a theory should be developed. Afterwards, some fundamental results on evolutionary algorithms are presented in order to show how theoretical results on randomized search heuristics can be proved and how they contribute to the understanding of evolutionary algorithms. | en |
| dc.format.extent | 183288 bytes | |
| dc.format.extent | 345490 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5410 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15302 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 111 | de |
| dc.subject.ddc | 004 | de |
| dc.title | Theoretical Aspects of Evolutionary Algorithms | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |