Sciweavers

84 search results - page 9 / 17
» HereBoy: A Fast Evolutionary Algorithm
Sort
View
DAGSTUHL
2006
13 years 11 months ago
How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
Boris Mitavskiy, Jonathan E. Rowe
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
EH
2003
IEEE
136views Hardware» more  EH 2003»
14 years 3 months ago
Experimental Results in Evolutionary Fault-Recovery for Field Programmable
This paper presents experimental results of fast intrinsic evolutionary design and evolutionary fault recovery of a 4-bit Digital to Analog Converter (DAC) using the JPL stand-alo...
Ricardo Salem Zebulum, Didier Keymeulen, Vu Duong,...
GECCO
2003
Springer
14 years 3 months ago
Optimizing the Order of Taxon Addition in Phylogenetic Tree Construction Using Genetic Algorithm
Phylogenetics has gained in public favor for the analysis of DNA sequence data as molecular biology has advanced. Among a number of algorithms for phylogenetics, the fastDNAml is c...
Yong-Hyuk Kim, Seung-Kyu Lee, Byung Ro Moon
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...