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...
Zapisane w:
| Wydane w: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| 1. autor: | |
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
International Journal of Combinatorial Optimization Problems and Informatics
2010
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://www.redalyc.org/articulo.oa?id=265219741003 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|