1099 search results - page 39 / 220 » On the Complexity of Computing Evolutionary Trees |
SCAI
2001
14 years 11 months ago
2001
We apply evolutionary algorithm (EA) to the design of controller for adaptive robots. EAs can be successful for more complicated tasks, where traditional engineering methods strugg...
122
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
WSCG
2003
14 years 11 months ago
2003
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ...
153
click to vote
ASC
2011
14 years 4 months ago
2011
Evolutionary algorithms provide flexibility and robustness required to find satisfactory solutions in complex search spaces. This is why they are successfully applied for solvin...