1099 search results - page 105 / 220 » On the Complexity of Computing Evolutionary Trees |
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
ITSSA
2006
14 years 10 months ago
2006
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
BMEI
2008
IEEE
15 years 4 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...
DSN
2007
IEEE
15 years 4 months ago
2007
IEEE
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
CAI
2010
Springer
14 years 5 months ago
2010
Springer
Present speech recognition systems are becoming more complex due to technology advances, optimizations and special requirements such as small computation and memory footprints. Pro...