Sciweavers

3020 search results - page 97 / 604
» Optimal partition trees
Sort
View
SAC
2011
ACM
14 years 9 months ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
WOB
2004
134views Bioinformatics» more  WOB 2004»
15 years 7 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 4 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ACL
2009
15 years 4 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
201
Voted
BDA
2004
15 years 7 months ago
Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...
Tuyet-Tram Dang-Ngoc, Georges Gardarin, Nicolas Tr...