654 search results - page 33 / 131 » On the Approximation of Computing Evolutionary Trees |
101
click to vote
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
JAIHC
2010
14 years 8 months ago
2010
The state of the art is explored in using soft computing (SC) methods for network intrusion detection, including the examination of efforts in ten specific areas of SC as well as ...
ICN
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We e...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...