Theory of Genetic Algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

Author： Schmitt L.M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.310, Iss.1, 2004-01, pp. : 181-231

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the convergence rates of genetic algorithms

By He J.   Kang L.  

Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. : 23-39

Elsevier

Access to resources Recommend Favorite

Genetic algorithms: bridging the convergence gap

By Lozano J.A.   Larranaga P.   Grana M.   Albizuri F.X.  

Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. : 11-22

Elsevier

Access to resources Recommend Favorite

Theory of genetic algorithms

By Schmitt L.M.  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 1-61

Elsevier

Access to resources Recommend Favorite

GASUB: finding global optima to discrete location problems by a genetic-like algorithm

By Pelegrín Blas   Redondo Juani   Fernández Pascual   García Inmaculada   Ortigosa Pilar  

Journal of Global Optimization, Vol. 38, Iss. 2, 2007-06 ,pp. : 249-264

Springer Publishing Company

Access to resources Recommend Favorite

Genetic Algorithms, Operators, and DNA Fragment Assembly

By Parsons R.J.  

Machine Learning, Vol. 21, Iss. 1-2, 1995-10 ,pp. : 11-33

Springer Publishing Company

Access to resources Recommend Favorite