IEEE - Institute of Electrical and Electronics Engineers, Inc. - Markov chain analysis of genetic algorithms for 3-SAT problem

2011 Seventh International Conference on Natural Computation (ICNC)

Author(s): Qinglian Ma ; Yu-an Zhang ; Yamamori, K. ; Sakamoto, M. ; Furutani, H.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 July 2011
Conference Location: Shanghai, China, China
Conference Date: 26 July 2011
Volume: 2
Page(s): 1,101 - 1,105
ISBN (CD): 978-1-4244-9952-6
ISBN (Electronic): 978-1-4244-9953-3
ISBN (Paper): 978-1-4244-9950-2
ISSN (CD): 2157-9555
ISSN (Electronic): 2157-9563
ISSN (Paper): 2157-9555
DOI: 10.1109/ICNC.2011.6022205
Regular:

There are many works to solve NP-complete problems by using Genetic Algorithms(GAs). The satisfiability (SAT) problem is the first proposed NP-complete problem, and plays a central role in... View More

Advertisement