14774 search results - page 116 / 2955 » Computational complexity and evolutionary computation |
RECOMB
2004
Springer
16 years 4 months ago
2004
Springer
154
Voted
PPSN
1994
Springer
15 years 8 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...
137
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
142
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
156
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...