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...
محفوظ في:
| الحاوية / القاعدة: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| المؤلف الرئيسي: | |
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
International Journal of Combinatorial Optimization Problems and Informatics
2010
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.redalyc.org/articulo.oa?id=265219741003 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|