Sciweavers

1060 search results - page 10 / 212
» On the Discovery of Random Trees
Sort
View
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 11 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
TCS
2010
15 years 20 days ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
SDM
2009
SIAM
127views Data Mining» more  SDM 2009»
16 years 3 months ago
Learning Random-Walk Kernels for Protein Remote Homology Identification and Motif Discovery.
Anthony J. Bonner, Martin Renqiang Min, Rui Kuang,...