Full metadata record
DC FieldValueLanguage
dc.contributor.authorHung, Ping-Chuen_US
dc.contributor.authorChen, Ying-Pingen_US
dc.date.accessioned2014-12-08T15:24:58Z-
dc.date.available2014-12-08T15:24:58Z-
dc.date.issued2006-01-01en_US
dc.identifier.isbn978-1-59593-186-3en_US
dc.identifier.issnen_US
dc.identifier.urihttp://hdl.handle.net/11536/17342-
dc.description.abstractExtended compact genetic algorithm (ECCA) is an algorithm that can solve hard problems in the binary domain. ECCA is reliable and accurate because of the capability of detecting building blocks, but certain difficulties are encountered when we directly apply ECGA to problems in the integer domain. In this paper, we propose a new algorithm that extends ECGA, called integer extended compact genetic algorithm (iECCA). iECGA uses a modified probability model and inherits the capability of detecting building blocks from ECGA. iECGA is specifically designed for problems in the integer domain and can avoid the difficulties that ECGA encounters. With the experimental results, we show the performance comparisons between ECCA, iECGA, and a simple GA. The results indicate that iECGA has good performance on problems in the integer domain.en_US
dc.language.isoen_USen_US
dc.titleiECGA: Integer extended compact genetic algorithmen_US
dc.typeProceedings Paperen_US
dc.identifier.journalGECCO 2006: Genetic and Evolutionary Computation Conference, Vol 1 and 2en_US
dc.citation.volumeen_US
dc.citation.issueen_US
dc.citation.spage1415en_US
dc.citation.epage1416en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
Appears in Collections:Conferences Paper