179 search results - page 23 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...
141
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
119
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all...
107
click to vote
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
116
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...