An Extension To the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms-Reference-Cited by-同舟云学术

An Extension To the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms

Published:1991 Issue: Volume: Page:53-68
ISSN:1081-6593
Container-title:Foundations of Genetic Algorithms
language:
Short-container-title:

Author:

Ankenbrandt Carol A.

Publisher

Elsevier

Reference12 articles.

1. Ankenbrandt, C.A. (1990a). The Time Complexity of Genetic Algorithms and the Theory of Recombination Operators. Doctoral Dissertation, Department of Computer Science, Tulane University, New Orleans, LA.

2. Ankenbrandt, C.A., B. P. Buckles, and F. E. Petry. (1990b). Scene Recognition Using Genetic Algorithms With Semantic Nets. Pattern Recognition Letters (11), pp. 285–293.

3. Ankenbrandt, C. A., B. P. Buckles, F. E. Petry, and M. Lybanon. (1989). Ocean Feature Recognition Using Genetic Algorithms With Fuzzy Fitness Functions (GA/F3), in Third Annual Workshop on Space Operations Automation and Robotics (SOAR1989), pp. 679–685, July 25–27, 1989.

4. Ankenbrandt, C. A. (1991). The Theory of Recombination Operators as Demonstrated with the Uniform Crossover Operator. In progress.

5. Differential Equations and Their Applications;Braun,1983

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hybrid quantum search with genetic algorithm optimization;PeerJ Computer Science;2024-08-05

2. Zigzag mutation: a new mutation operator to improve the genetic algorithm;Multimedia Tools and Applications;2023-05-01

3. mPoW: How to Make Proof of Work Meaningful;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-03-01

4. Design of an Optimal Testbed for Acoustic Tags: Test Case for Marine Megafauna;Frontiers in Marine Science;2022-06-30

5. Performance of C++ Language Code in Quantum Computing Environment;Machine Learning and Information Processing;2020