Genetic algorithm behavior in the MAXSAT domain-Reference-Cited by-同舟云学术

Genetic algorithm behavior in the MAXSAT domain

Published:1998 Issue: Volume: Page:785-794
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Rana Soraya,Whitley Darrell

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0056920

Reference10 articles.

1. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proc. Twelfth International Joint Conference on Artificial Intelligence, 1991.

2. M. Davis and H Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.

3. J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems. Golden West International Conference on Artificial Intelligence, 1994.

4. J. Frank, P. Cheeseman, and J. Stutz. When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7:249–281, 1997.

5. D. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, 3:129–152, 1989.

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

1. Towards explainable metaheuristic;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09

2. Frequency Fitness Assignment: Optimization without Bias for Good Solutions can be Efficient;IEEE Transactions on Evolutionary Computation;2022

3. Automated non-monotonic reasoning in System P;Annals of Mathematics and Artificial Intelligence;2021-04-07

4. Frequency Fitness Assignment: Making Optimization Algorithms Invariant Under Bijective Transformations of the Objective Function Value;IEEE Transactions on Evolutionary Computation;2021-04

5. Gray Box Optimization for Mk Landscapes (NK Landscapes and MAX-kSAT);Evolutionary Computation;2016-09