— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...