A new quantum evolutionary local search algorithm for MAX 3-SAT problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5271 LNAI, Issue , 2008, Pages 172-179

  Layeb, Abdesslem ^a   Saidouni, Djamel Eddine ^a  

^a Universite Mentouri Constantine   (Algeria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FORMULAE; BOOLEAN VARIABLES; EVOLUTIONARY DYNAMICS; HYBRID ALGORITHMS; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MAX-SAT PROBLEMS; NP-HARD; NUMBER OF ITERATIONS; POPULATION SIZES; QUANTUM COMPUTING; SAT PROBLEMS; STOCHASTIC APPROACH;

ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; LEARNING ALGORITHMS; POPULATION STATISTICS; QUANTUM COMPUTERS;

EVOLUTIONARY ALGORITHMS;

EID: 70350543596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87656-4_22     Document Type: Conference Paper

References (10)

1. Cook, S.A.: The Complexity of Theorem Proving Procedures. In: Proc. 3rd Ann. ACM Symp. On Theory of Computing, Association for Computing Machinery, pp. 151-158 (1971)
2. Alsinet, T., Manya, F., Planes, J.: Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. In: Proceedings of Sixth Catalan Conference on Artificial Intelligence (CCIA 2003) (October 2003)
3. Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Proc. of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 393-400 (1999)
4. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers 48(5), 506-521 (1999)
5. Holger, H., Stützle, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning 24(4), 421-481 (2000)
6. Williams, C.P., Clearwater, S.H.: Explorations in quantum computing. Springer, Berlin (1998)
7. Han, K.H., Kim, J.H.: Quantum-inspired Evolutionary Algorithms with a New Termination Criterion, Hå Gate, and Two Phase Scheme. IEEE Transactions on Evolutionary Computation 8(2), 156-169 (2004)
8. Layeb, A., Saidouni, D.E.: Quantum Genetic Algorithm for Binary Decision Diagram Ordering Problem. The proceeding of International Journal of Computer Science and Network Security 7(9), 130-135 (2007)
9. Layeb, A., Meshoul, S., Batouhe, M.: Multiple Sequence Alignment by Quantum Genetic Algorithm. In: The 7th International Workshop on Parallel and Distributed Scientific and Engineering Computing of the 20th International Parallel and Distributed Processing Symposium, Greece, pp. 1-8 (April 2006)
10. Asahiro, Y., Iwama, K., Miyano, E.: Random Generation of Test Instanzes with Controlled Attributes. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge. DIMACS Series on Discr. Math. and Theor. Comp. Sci, vol. 26, pp. 377-394 (1996), http://www.cs.ubc.ca/~hoos/SATLIB/Benchmarks/SAT/DIMACS/AIM/descr.html