1099 search results - page 74 / 220 » On the Complexity of Computing Evolutionary Trees |
128
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
121
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract-- Exploring microRNA (miRNA) and mRNA regulatory interactions may give new insights into diverse biological phenomena. While elucidating complex miRNA-mRNA interactions ha...
163
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
140
click to vote
EC
2006
15 years 4 months ago
2006
The error threshold of replication is an important notion of the quasispecies evolution model; it is a critical mutation rate (error rate) beyond which structures obtained by an e...
148
click to vote
AAAI
1996
15 years 5 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...