Sciweavers

1099 search results - page 20 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
IJON
2008
152views more  IJON 2008»
14 years 8 months ago
Topos: Spiking neural networks for temporal pattern recognition in complex real sounds
This article depicts the approach used to build the Topos application, a simulation of two-wheel robots able to discern real complex sounds. Topos is framed in the nouvelle concep...
Pablo González-Nalda, Blanca Cases
AAAI
2006
14 years 11 months ago
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Yang Yu, Zhi-Hua Zhou
FCT
2007
Springer
15 years 3 months ago
On the Topological Complexity of Weakly Recognizable Tree Languages
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
Jacques Duparc, Filip Murlak
COMPLEXITY
2004
165views more  COMPLEXITY 2004»
14 years 9 months ago
Sex promotes gamete selection: A quantitative comparative study of features favoring the evolution of sex
: Explaining the maintenance of sexual reproduction remains one of the greatest challenges in biology. The theoretical oddity of sex is based on at least three advantages that asex...
Klaus Jaffe