321 search results - page 8 / 65 » Comparison of Additive Trees Using Circular Orders |
139
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
127
click to vote
JCB
2006
15 years 2 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
137
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
135
Voted
IJBRA
2007
15 years 2 months ago
2007
: Document clustering has been used for better document retrieval and text mining. In this paper, we investigate if a biomedical ontology improves biomedical literature clustering ...
238
Voted
ICNP
1996
IEEE
15 years 6 months ago
1996
IEEE
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...