894 search results - page 120 / 179 » Parameter-less evolutionary search |
TIT
1998
14 years 11 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
105
click to vote
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima...
AISB
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...