# IEEE Transactions on Evolutionary Computation

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 58 - 79

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 150 - 169

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 112 - 132

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 23 - 57

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 103 - 111

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 133 - 149

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 80 - 102

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 1 > 1 - 22

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 2 > 252 - 277

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 2 > 278 - 300

*n*-dimensional continuous space, the advancement of using PSO to find solutions in a discrete space is at a slow pace. In this paper, a novel set-based PSO (S-PSO) method for the solutions of some combinatorial optimization problems (COPs)...

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 2 > 246 - 251

*n??n*matrix multiplication from the order of

*n*

^{3}to

*n*

^{2.81}. It soon became one of the most famous scientific discoveries in the 20th century and provoked numerous studies by other mathematicians to improve upon it. Although a number of improvements have been made, Strassen's...

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 2 > 173 - 190

IEEE Transactions on Evolutionary Computation > 2010 > 14 > 2 > 227 - 245