MastersWork.RefKargupta History
Hide minor edits - Show changes to output
Changed lines 22-24 from:
Probably not useful for info on representation.
to:
Probably not useful for info on representation.
-----
<|ReferencesFound|>
-----
<|ReferencesFound|>
Changed lines 20-22 from:
url = "citeseer.nj.nec.com/kargupta96gene.html" }
to:
url = "citeseer.nj.nec.com/kargupta96gene.html" }=]
!!!Notes:
Probably not useful for info on representation.
!!!Notes:
Probably not useful for info on representation.
Changed lines 1-20 from:
to:
!The Gene Expression Messy Genetic Algorithm
!!Hillol Kargupta
!!!Abstract:
This paper introduces the gene expression messy genetic
algorithm (GEMGA) a new generation of messy GAs that
directly search for relations among the members of the
search space. The GEMGA is an O(A^k( l^2 q- k)) sample complexity algorithm for the class of order-k delineable problems (problems that can be solved by considering
no higher than order-k relations). The GEMGA is
designed based on an alternate perspective of natural evolution proposed by the SEARCH framework that emphasizes the role of gene expression. The GEMGA uses
the transcription operator to search for relations. This paper
also presents the test results of the GEMGA for large
multimodal order-k delineable problems.
!!!Bibliographical:
[=@inproceedings{ kargupta96gene,
author = "Hillol Kargupta",
title = "The Gene Expression Messy Genetic Algorithm",
booktitle = "International Conference on Evolutionary Computation",
pages = "814-819",
year = "1996",
url = "citeseer.nj.nec.com/kargupta96gene.html" }
!!Hillol Kargupta
!!!Abstract:
This paper introduces the gene expression messy genetic
algorithm (GEMGA) a new generation of messy GAs that
directly search for relations among the members of the
search space. The GEMGA is an O(A^k( l^2 q- k)) sample complexity algorithm for the class of order-k delineable problems (problems that can be solved by considering
no higher than order-k relations). The GEMGA is
designed based on an alternate perspective of natural evolution proposed by the SEARCH framework that emphasizes the role of gene expression. The GEMGA uses
the transcription operator to search for relations. This paper
also presents the test results of the GEMGA for large
multimodal order-k delineable problems.
!!!Bibliographical:
[=@inproceedings{ kargupta96gene,
author = "Hillol Kargupta",
title = "The Gene Expression Messy Genetic Algorithm",
booktitle = "International Conference on Evolutionary Computation",
pages = "814-819",
year = "1996",
url = "citeseer.nj.nec.com/kargupta96gene.html" }
Page last modified on January 12, 2005, at 02:50 AM