912 search results - page 34 / 183 » A New Approach to Improve Particle Swarm Optimization |
139
click to vote
SAC
2011
ACM
14 years 4 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
131
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...
117
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Peer-to-peer based distributed computing environments can be expected to be dynamic to greater of lesser degree. While node losses will not usually lead to catastrophic...
103
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
112
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarm, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid alg...