1099 search results - page 163 / 220 » On the Complexity of Computing Evolutionary Trees |
144
click to vote
GECCO
2008
Springer
15 years 5 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...
218
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...
151
click to vote
CEC
2010
IEEE
14 years 7 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...
152
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Phylogenetic trees resulting from molecular phylogenetic analysis are available in Newick format from specialized databases but when it comes to phylogenetic networks,...
125
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...