84 search results - page 10 / 17 » An Individually Variable Mutation-Rate Strategy for Genetic ... |
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
BMCBI
2010
13 years 7 months ago
2010
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...