Sciweavers

16430 search results - page 159 / 3286
» On Computable Tree Functions
Sort
View
120
Voted
RECOMB
2001
Springer
16 years 4 months ago
Fast recovery of evolutionary trees with thousands of nodes
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
Miklós Csürös
123
Voted
CCGRID
2002
IEEE
15 years 8 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
142
Voted
TCS
2010
14 years 10 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
147
Voted
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
15 years 9 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
125
Voted
IJAR
2007
87views more  IJAR 2007»
15 years 3 months ago
Pruning belief decision tree methods in averaging and conjunctive approaches
The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interp...
Salsabil Trabelsi, Zied Elouedi, Khaled Mellouli