8978 search results - page 444 / 1796 » Parallel Genetic Algorithms |
193
click to vote
CIMCA
2005
IEEE
16 years 1 months ago
2005
IEEE
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
241
click to vote
GECCO
2003
Springer
16 years 26 days ago
2003
Springer
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
191
click to vote
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
181
click to vote
DCC
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents and evaluates gFPC, a self-tuning implementation of the FPC compression algorithm for double-precision floating-point data. gFPC uses a genetic algorithm to re...
193
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
The problem of multiple sequence alignment is important for bioinformatics. This problem is widely studied and a popular tool to solve this problem is Clustal X. This work introdu...