1060 search results - page 16 / 212 » On the Discovery of Random Trees |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
Discovery of sequential patterns is becoming increasingly useful and essential in many scienti c and commercial domains. Enormous sizes of available datasets and possibly large nu...
EJWCN
2010
14 years 4 months ago
2010
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
RSA
1998
14 years 9 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
ECCC
2010
14 years 7 months ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...