444 search results - page 44 / 89 » Solving Mastermind Using Genetic Algorithms |
116
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
106
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we describe a GA to solve for the orientation and lens characteristics of a projector, given images of a dome screen illuminated by the projector. We use synthetic ...
123
click to vote
TEC
2002
15 years 4 months ago
2002
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...
146
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
147
click to vote
IJIT
2004
15 years 5 months ago
2004
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...