196 search results - page 23 / 40 » Assortative Mating in Genetic Algorithms for Dynamic Problem... |
TCS
2008
13 years 7 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
ICGA
1993
13 years 9 months ago
1993
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
ISPAN
2005
IEEE
14 years 1 months ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...