3055 search results - page 58 / 611 » Randomized Search Trees |
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
ICMLA
2007
13 years 10 months ago
2007
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
GECCO
2006
Springer
14 years 22 days ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
JGO
2010
13 years 7 months ago
2010
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...