No abstract available.
Cited By
- Daida J and Hilss A Identifying structural mechanisms in standard genetic programming Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII, (1639-1651)
- Penaud J and Roques O (2002). Tirage a pile ou face de mots de Fibonacci, Discrete Mathematics, 256:3, (791-800), Online publication date: 28-Oct-2002.
- Ross B (2001). Logic-based genetic programming with definite clause translation grammars, New Generation Computing, 19:4, (313-337), Online publication date: 1-Dec-2001.
- Langdon W (2000). Size Fair and Homologous Tree Crossovers for Tree Genetic Programming, Genetic Programming and Evolvable Machines, 1:1-2, (95-119), Online publication date: 1-Apr-2000.
- Wilson D and Propp J How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (448-457)
Recommendations
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
The random hash tree and the N-tree were introduced by Ehrlich in 1981. In the random hash tree, n data points are hashed to values X1, . . . , Xn, independently and identically distributed random variables taking values that are uniformly distributed ...
Random number generation
Encyclopedia of Computer ScienceA random number generator is a computer procedure that scrambles the bits of a current number or set of numbers to produce a new number, in such a way that the result appears to be randomly distributed among the set of possible numbers and independent ...
Faster Generation of Random Spanning Trees
FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer ScienceIn this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative $(1+\delta)$ of uniform in expected time $\TO(m\sqrt{...