Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorImada, A.
dc.date.accessioned2019-10-21T20:41:04Z
dc.date.available2019-10-21T20:41:04Z
dc.date.issued1999
dc.identifier.urihttps://dx.doi.org/10.1109/CEC.1999.782648
dc.identifier.urihttps://hdl.handle.net/11421/20644
dc.descriptionEvolutionary Programming Society (EPS);IEEE Neural Network Council (NNC);Institution of Electrical Engineers (IEE)en_US
dc.description1999 Congress on Evolutionary Computation, CEC 1999 -- 6 July 1999 through 9 July 1999 -- Washington, DC -- 105218en_US
dc.description.abstractWhen we search for an infinitely large number of solutions by evolutionary algorithms, it is helpful to learn the topology of the fitness landscape to know whether the solutions we obtained are representative samples of the whole solutions. Some solutions are easy to be approached and others are not in general. As a step to learn the whole geometry of fitness landscape, we exploit, in this paper, a downhill walk by evolutionary programming to reveal the shape of global peaks on the fitness landscape defined on weight spaceen_US
dc.language.isoengen_US
dc.publisherIEEE Computer Societyen_US
dc.relation.isversionof10.1109/CEC.1999.782648en_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.titleDownhill walk from the top of a hill by evolutionary programmingen_US
dc.typeconferenceObjecten_US
dc.relation.journalProceedings of the 1999 Congress on Evolutionary Computation, CEC 1999en_US
dc.contributor.departmentAnadolu Üniversitesi, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümüen_US
dc.identifier.volume2en_US
dc.identifier.startpage1414en_US
dc.identifier.endpage1418en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US]


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster