Sciweavers

882 search results - page 46 / 177
» On the Application of Evolutionary Algorithms to the Consens...
Sort
View
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 10 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 1 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
CORR
2007
Springer
134views Education» more  CORR 2007»
13 years 8 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
BMCBI
2010
135views more  BMCBI 2010»
13 years 8 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
PPSN
2004
Springer
14 years 1 months ago
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...