3120 search results - page 299 / 624 » A parameter-less genetic algorithm |
152
click to vote
GECCO
2003
Springer
15 years 10 months 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...
162
Voted
PPSN
1994
Springer
15 years 9 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
150
click to vote
AAIM
2007
Springer
15 years 8 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...
134
click to vote
DCC
2010
IEEE
15 years 11 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...
139
click to vote
GECCO
2005
Springer
15 years 10 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...