1060 search results - page 71 / 212 » On the Discovery of Random Trees |
RSA
2010
14 years 8 months ago
2010
We consider a system of particles with arms that are activated randomly to grab other particles as a toy model for polymerization. We assume that the following two rules are fulï¬...
103
click to vote
SAC
2003
ACM
15 years 3 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
RSA
2010
14 years 8 months ago
2010
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
108
Voted
EDBT
2012
ACM
13 years 15 days ago
2012
ACM
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...