MastersWork.RefChakrabortyJanikow2003 History
Hide minor edits - Show changes to output
Changed lines 9-11 from:
Local filename: science3.pdf
to:
Local filename: science3.pdf
!!!Notes:
Does a fairly heavy theoretical analysis of Gray versus binary coding. May not be too useful (and is hard to understand), but supplies an awful lot of hopefully good references.
!!!Notes:
Does a fairly heavy theoretical analysis of Gray versus binary coding. May not be too useful (and is hard to understand), but supplies an awful lot of hopefully good references.
Changed lines 4-9 from:
This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is not much difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.
to:
This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is not much difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.
!!!Bibliographical:
Uday K. Chakraborty and Cezary Z. Janikow, An analysis of Gray versus binary encoding in genetic search, ''Information Sciences'', Volume 156, Issues 3-4, 15 November 2003, Pages 253-269.
!!!URL:
[[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0C-4950PV1-7&_coverDate=11%2F15%2F2003&_alid=180518506&_rdoc=1&_fmt=&_orig=search&_qd=1&_cdi=5643&_sort=d&view=c&_acct=C000007718&_version=1&_urlVersion=0&_userid=100241&md5=f8f3d3c9c8dda70a08861577716102fd ScienceDirect]]\\
Local filename: science3.pdf
!!!Bibliographical:
Uday K. Chakraborty and Cezary Z. Janikow, An analysis of Gray versus binary encoding in genetic search, ''Information Sciences'', Volume 156, Issues 3-4, 15 November 2003, Pages 253-269.
!!!URL:
[[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0C-4950PV1-7&_coverDate=11%2F15%2F2003&_alid=180518506&_rdoc=1&_fmt=&_orig=search&_qd=1&_cdi=5643&_sort=d&view=c&_acct=C000007718&_version=1&_urlVersion=0&_userid=100241&md5=f8f3d3c9c8dda70a08861577716102fd ScienceDirect]]\\
Local filename: science3.pdf
Changed lines 1-4 from:
to:
!An analysis of Gray versus binary encoding in genetic search
!!Uday K. Chakraborty, and Cezary Z. Janikow
!!!Abstract:
This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is not much difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.
!!Uday K. Chakraborty, and Cezary Z. Janikow
!!!Abstract:
This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is not much difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.
Page last modified on January 12, 2005, at 02:50 AM