It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...
William M. Spears, Derek T. Green, Diana F. Spears
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
In this paper, we discuss how to apply the rate distortion technique to select the optimal mode in the scalable coding. Firstly, we analyze this problem from a general scalable mo...
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Inspired by bacterial motility, we propose an algorithm for adaptation over networks with mobile nodes. The nodes have limited abilities and they are allowed to cooperate with the...