Sciweavers

654 search results - page 98 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
73
Voted
RECOMB
2005
Springer
15 years 10 months ago
Likely Scenarios of Intron Evolution
Whether common ancestors of eukaryotes and prokaryotes had introns is one of the oldest unanswered questions in molecular evolution. Recently completed genome sequences have been u...
Miklós Csürös
ICCS
2007
Springer
15 years 3 months ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...
WSTST
2005
Springer
15 years 3 months ago
Hybrid Neurocomputing for Breast Cancer Detection
Breast cancer is one of the major tumor related cause of death in women. Various artificial intelligence techniques have been used to improve the diagnoses procedures and to aid t...
Yuehui Chen, Ajith Abraham, Bo Yang
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 9 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah