This paper presents a new variant of Basic Particle Swarm Optimization (BPSO) algorithm named QI-PSO for solving global optimization problems. The QI-PSO algorithm makes use of a ...
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...