Sciweavers

2157 search results - page 241 / 432
» Binary ant algorithm
Sort
View
WABI
2005
Springer
15 years 12 months ago
Computing the Quartet Distance Between Trees of Arbitrary Degree
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
Chris Christiansen, Thomas Mailund, Christian N. S...
178
Voted
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
HPCN
1997
Springer
15 years 10 months ago
Boolean Function Manipulation on a Parallel System Using BDDs
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
F. Bianchi, Fulvio Corno, Maurizio Rebaudengo, Mat...
DLOG
2008
15 years 8 months ago
Consistency Checking for Extended Description Logics
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
Olivier Couchariere, Marie-Jeanne Lesot, Bernadett...
IJIT
2004
15 years 7 months ago
IMDC: An Image-Mapped Data Clustering Technique for Large Datasets
In this paper, we present a new algorithm for clustering data in large datasets using image processing approaches. First the dataset is mapped into a binary image plane. The synthe...
Faruq A. Al-Omari, Nabeel I. Al-Fayoumi