Search Sciweavers | Sciweavers

1060 search results - page 10 / 212

» On the Discovery of Random Trees

click to vote

GECCO
2004
Springer

129views Optimization» more GECCO 2004»

Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys

15 years 3 months ago

Download www.cs.york.ac.uk

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

claim paper

Read More »

click to vote

TCS
2010

164views Theoretical Computer Science» more TCS 2010»

Parametric random generation of deterministic tree automata

14 years 4 months ago

Download www.lsv.ens-cachan.fr

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 ...

claim paper

Read More »

click to vote

SDM
2009
SIAM

127views Data Mining» more SDM 2009»

Learning Random-Walk Kernels for Protein Remote Homology Identification and Motif Discovery.

15 years 7 months ago

Download www.cs.toronto.edu

Anthony J. Bonner, Martin Renqiang Min, Rui Kuang,...

claim paper

Read More »