Abstract
Simple genetic algorithms have been used in a wide range of engineering and scientific fields to quickly procure useful solutions to poorly understood optimization problems. Unfortunately, despite the routine use of these algorithms for over three decades, their remarkable adaptive capacity has not been adequately accounted for. In my dissertation, I develop, submit, and support the
generative fixation hypothesis
---a unified explanation for the adaptive capacity of the simple genetic algorithm.
Publisher
Association for Computing Machinery (ACM)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献