DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Background. Recent studies have shown that Support Vector Regression (SVR) has an interesting potential in the field of effort estimation. However applying SVR requires to careful...
Anna Corazza, Sergio Di Martino, Filomena Ferrucci...
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
Gerry V. Dozier, Hurley Cunningham, Winard Britt, ...