1099 search results - page 46 / 220 » On the Complexity of Computing Evolutionary Trees |
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
Since the genomics revolution, bioinformatics has never been so popular. Many researchers have investigated with great success the use of evolutionary computation in bioinformatic...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...