![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Swarm and Evolutionary Computation, Volume 9
Volume 9, April 2013
- Seyedali Mirjalili
, Andrew Lewis
:
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization. 1-14 - Ahmed Al-Ani, Akram AlSukker
, Rami N. Khushaba
:
Feature subset selection using differential evolution and a wheel based search strategy. 15-26 - Shi-Zheng Zhao, Ponnuthurai Nagaratnam Suganthan
:
Empirical investigations into the exponential crossover of differential evolutions. 27-36 - Rajdeep Dutta, Ranjan Ganguli
, V. Mani:
Exploring isospectral cantilever beams using electromagnetism inspired optimization technique. 37-46 - Trilochan Panigrahi, Ganapati Panda
, Bernard Mulgrew
, Babita Majhi:
Distributed DOA estimation using clustering of sensor nodes and diffusion PSO algorithm. 47-57 - Swagatam Das
, Rammohan Mallipeddi, Dipankar Maity:
Adaptive evolutionary programming with p-best mutation strategy. 58-68 - K. Suresh, Narayanan Kumarappan:
Hybrid improved binary particle swarm optimization approach for generation maintenance scheduling problem. 69-89 - Ahmad Mozaffari, Mofid Gorji-Bandpy, Pendar Samadian, Rouzbeh Rastgar, Alireza Rezania Kolaei
:
Comprehensive preference optimization of an irreversible thermal engine using pareto based mutable smart bee algorithm and generalized regression neural network. 90-103
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.