Sciweavers

1099 search results - page 36 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
JAIHC
2010
205views more  JAIHC 2010»
14 years 8 months ago
Soft computing in intrusion detection: the state of the art
The state of the art is explored in using soft computing (SC) methods for network intrusion detection, including the examination of efforts in ten specific areas of SC as well as ...
Chet Langin, Shahram Rahimi
CEC
2008
IEEE
15 years 4 months ago
Auto-tuning fuzzy granulation for evolutionary optimization
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
14 years 9 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
PPSN
2004
Springer
15 years 3 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
GECCO
2003
Springer
15 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