654 search results - page 22 / 131 » On the Approximation of Computing Evolutionary Trees |
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
154
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
139
Voted
ICTAI
2003
IEEE
15 years 3 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
Peptide compositions constructed out of whole sets of protein sequences can be used as species signatures for phylogenetic analysis. To account for point mutations, an amino acid ...
114
click to vote
EUROGP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...