1310 search results - page 76 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
167
click to vote
AAIM
2007
Springer
15 years 10 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...
197
click to vote
IPPS
2006
IEEE
16 years 9 days ago
2006
IEEE
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
166
click to vote
IPPS
2007
IEEE
16 years 17 days ago
2007
IEEE
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
171
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
141
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...