3136 search results - page 207 / 628 » Complex networks and evolutionary computation |
166
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
156
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
153
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
227
click to vote
ICST
2011
IEEE
14 years 8 months ago
2011
IEEE
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...
155
click to vote
CEC
2010
IEEE
14 years 8 months ago
2010
IEEE
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...