1099 search results - page 12 / 220 » On the Complexity of Computing Evolutionary Trees |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
COLING
1996
14 years 11 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
100
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
ISMDA
2005
Springer
15 years 3 months ago
2005
Springer
Over recent years the field of phylogenetics has witnessed significant algorithmic and technical progress. A new class of efficient phylogeny programs allows for computation of l...
ECAL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specific...