A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem

In this paper we investigate the use of quantum particle swarm optimization (QPSO) principles to resolve the satisfiability problem. We describe QPSOSAT, a new iterative approach for solving the well known Maximum Satisfiability problem (MAX-SAT). This latter has been shown to be NP-hard if the numb...

Description complète

Enregistré dans:
Détails bibliographiques
Publié dans:International Journal of Combinatorial Optimization Problems and Informatics
Auteur principal: Abdesslem Layeb
Format: Artigo
Langue:Inglês
Publié: International Journal of Combinatorial Optimization Problems and Informatics 2010
Sujets:
Computación
Local search
Maximum Satisfiabilty problem
Quantum Particle Swarm Optimization
Accès en ligne:https://www.redalyc.org/articulo.oa?id=265219741003
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires