Modelling hierarchical genetic strategy as a family of markov chains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2328, Issue , 2002, Pages 595-598

  Kołodziej, Joanna ^a  

^a UNIVERSITY OF BIELSKO BIALA   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; MERCURY COMPOUNDS;

ASYMPTOTIC PROPERTIES; SEQUENTIAL GENETIC ALGORITHMS; SIMPLE GENETIC ALGORITHM;

MARKOV CHAINS;

EID: 84947581565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_65     Document Type: Conference Paper

References (4)

1. Kołodziej J., Gwizdała R., Wojtusiak J.: Hierarchical Genetic Strategy as a Method of Improving Search Efficiency, Advances in Multi-Agents Systems, R Schaefer and S. Sędziwy eds.,UJ Press, Chapter 7, 200, pp.149-161.
2. Obuchowicz A.: Performance Analysis of Crossing Multi-Dimensional Saddles by Evolutionary Search Algorithms, Proc. of the 4-th Polish Conference on Evolutionary Algorithms, Lądek Zdrój, 2000.06.05-08, pp.155-162.
3. Schaefer R., Jabłoński Z. J.: On The Convergence Of Sampling Measures In Global Genetic Search, Submitted to Proc. of the PPAM’01, 4-th International Conference On Parallel Processing And Applied Mathematics, Nałęczów, Poland, 2001,09.9-12.
4. Vose M.D.: The Simple Genetic Algorithm, MIT Press (1999).