1099 search results - page 122 / 220 » On the Complexity of Computing Evolutionary Trees |
102
click to vote
STACS
2001
Springer
15 years 2 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
111
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
CEC
2005
IEEE
14 years 12 months ago
2005
IEEE
Abstract- Interactive combat games are useful as testbeds for learning systems employing evolutionary computation. Of particular value are games that can be modified to accommodate...
117
click to vote
TSMC
2008
14 years 10 months ago
2008
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...