Cellular genetic algorithms and local search for 3-SAT problem on graphic hardware

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 2988-2992

  Zhongwen, Luo ^a,b   Hongzhi, Liu ^a,c  

^a CHINA UNIVERSITY OF GEOSCIENCES   (China)

^b CHINA UNIVERSITY OF GEOSCIENCES   (China)

^c PEKING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; COMPUTER SCIENCE; GENETIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

GRAPHIC HARDWARE; LOCAL SEARCH; SIMD MODELS;

COMPUTER HARDWARE;

EID: 34547381634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Cook, S. A. The complexity of theorom-proving procedures. Proceedings 3rd Annual ACM Symposium on the Theory of Computing. New York. 1971, 151-158
2. Gianluigi Folino, Clara Pizzuti, Giandomenico Spezzano, Combining Cellular Genetic Algorithms and Local Search for Solving Satisfiability Problems, 1998
3. De Jong, K.A. & W. Spears (1989) Using Genetic Algorithms to Solve NP-Complete Problems, International Conference on Genetic Algorithms, George Mason University, Fairfax, Virginia, June 1989, pgs. 124-132.
4. Stefan Harmeling, Solving Satisfiability Problems with Genetic Algorithms, Genetic Algorithms and Genetic Programming at Stanford 2000, 206-213
5. Bart Selman ,Henry Kautz, Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiebility Problems, Proceeding of UCAI-93, 1993
6. Fernando R. and Killgard, M.J. The Cg Tutorial: The Definitive Guide to Programmable Real-Time Graphics Addison-Wisley, 2003
7. Gianluigi Folino, Clara Pizzuti, Giandomenico Spezzano, Solving the Satisfiability Problem by a Parallel Cellular Genetic Algorithm, 1998
8. LUO Zhongwen, YANG Zhengping, LIU Hongzhi ,LV Weixian, GA Computation of 3-SAT problem on Graphic Process Unit, ISICA'2005
9. Thompson, C. J., Hahn, S., and Oskin, M. Using modern graphics architectures for general-purpose computing: A framework and analysis. International Symposium on Microarchitecture. 2002.
10. D. Mitchell, B. Selman, and H. Levesque, "Hard and easy distributions of SAT problems," in Proc. 10th Nation Conf. Artificial Intelligence, July 1992, pp. 459-465.
11. B. Selman, H. A. Kautz, and B. Cohen, "Noise strategies for improving local search," in Proc. 12th Nation Conf. Artificial Intelligence, 1994, pp. 337-343.
12. Darrell Whitley, A Genetic Algorithm Tutorial, Statistics and Computing(4):65-85, 1994
13. SATLIB: The satisfiability library [Online]. Available: http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/