203 search results - page 6 / 41 » Fitness landscapes and problem hardness in evolutionary comp... |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes a new simple operator for Evolutionary Algorithms (EA) to climb ridged landscapes. Categories and Subject Descriptors: I.2.8 [Computing Methodologies]: Proble...
72
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
CEC
2010
IEEE
14 years 10 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...
TEC
2010
14 years 4 months ago
2010
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
PPSN
1998
Springer
15 years 1 months ago
1998
Springer
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...