2034 search results - page 221 / 407 » On the Comparability of Software Clustering Algorithms |
CPM
1998
Springer
14 years 18 days ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
BMCBI
2007
13 years 8 months ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
CLEF
2009
Springer
13 years 9 months ago
2009
Springer
This paper describes the participation of LIG lab, in the batch filtering task for the INFILE (INformation FILtering Evaluation) campaign of CLEF 2009. As opposed to the online ta...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion de...
AI
2007
Springer
13 years 8 months ago
2007
Springer
The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if...