Sciweavers

2407 search results - page 328 / 482
» The evolutionary forest algorithm
Sort
View
WABI
2005
Springer
15 years 10 months ago
Computing the Quartet Distance Between Trees of Arbitrary Degree
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
Chris Christiansen, Thomas Mailund, Christian N. S...
AE
2003
Springer
15 years 10 months ago
Optimising Graph Partitions Using Parallel Evolution
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
Raul Baños, Consolación Gil, Julio O...
ICMLA
2007
15 years 6 months ago
Improving gene expression programming performance by using differential evolution
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
Qiongyun Zhang, Chi Zhou, Weimin Xiao, Peter C. Ne...
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 6 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 7 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan