Sciweavers

1503 search results - page 101 / 301
» Self-optimizing distributed trees
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 4 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
BMCBI
2008
134views more  BMCBI 2008»
13 years 10 months ago
Stability analysis of mixtures of mutagenetic trees
Background: Mixture models of mutagenetic trees are evolutionary models that capture several pathways of ordered accumulation of genetic events observed in different subsets of pa...
Jasmina Bogojeska, Thomas Lengauer, Jörg Rahn...
SAC
2005
ACM
14 years 3 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
ICALP
2005
Springer
14 years 3 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 1 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio