Sciweavers

2174 search results - page 21 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
PPSN
2010
Springer
14 years 8 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
EVOW
2003
Springer
15 years 3 months ago
Hybrid Evolution Strategy-Downhill Simplex Algorithm for Inverse Light Scattering Problems
The rough surface inverse scattering problem is approached with a combination of evolutionary strategies and the simplex method. The surface, assumed one-dimensional and perfectly ...
Demetrio Macías, Gustavo Olague, Eugenio R....
IJIT
2004
14 years 11 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
PATAT
1995
Springer
122views Education» more  PATAT 1995»
15 years 1 months ago
A Memetic Algorithm for University Exam Timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
Edmund K. Burke, James P. Newall, Rupert F. Weare
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 4 months ago
Heuristic speciation for evolving neural network ensemble
Speciation is an important concept in evolutionary computation. It refers to an enhancements of evolutionary algorithms to generate a set of diverse solutions. The concept is stud...
Shin Ando