Some Theoretical Properties of Evolutionary Algorithms under Partially Ordered Fitness Values

Full metadata record

DC Field	Value	Language
dc.contributor.author	Rudolph, Günter	de
dc.date.accessioned	2004-12-07T08:20:46Z	-
dc.date.available	2004-12-07T08:20:46Z	-
dc.date.created	2001	de
dc.date.issued	2001-10-29	de
dc.identifier.uri	http://hdl.handle.net/2003/5406	-
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15297	-
dc.description.abstract	Presently, the limit theory of evolutionary algorithms (EA) for mono-criterion optimization under certainty is well developed. The situation is different for the fields of evolutionary optimization under complete or partial uncertainty, multiple criteria and so forth. Since these problem classes may be seen as special cases of the task of finding the set of minimal (or maximal) elements in partially ordered sets, a limit theory for EAs that can cope with this kind of problem passes all properties and results on its special cases mentioned above.	en
dc.format.extent	75535 bytes	-
dc.format.extent	92444 bytes	-
dc.format.mimetype	application/pdf	-
dc.format.mimetype	application/postscript	-
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 107	de
dc.subject.ddc	004	de
dc.title	Some Theoretical Properties of Evolutionary Algorithms under Partially Ordered Fitness Values	en
dc.type	Text	de
dc.type.publicationtype	report	-
dcterms.accessRights	open access	-
Appears in Collections:	Sonderforschungsbereich (SFB) 531

Files in This Item:

File	Description	Size	Format
ci107.pdf	DNB	73.76 kB	Adobe PDF	View/Open
ci107.ps		90.28 kB	Postscript	View/Open

This item is protected by original copyright

Show simple item record

This item is protected by original copyright rightsstatements.org