620 search results - page 55 / 124 » Likelihood Computations Using Value Abstraction |
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract-- A key indicator of problem difficulty in evolutionary computation problems is the landscape's locality, that is whether the genotype-phenotype mapping preserves nei...
PPSN
1994
Springer
14 years 2 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...
AAIM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
ASM
2003
ASM
14 years 3 months ago
2003
ASM
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. This paper presents an intelligent method based on multiuobjective genetic algorithm (MOGA) for prediction of limit cycle in multivariable nonlinear systems. First we add...