444 search results - page 1 / 89 » Solving Mastermind Using Genetic Algorithms |
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
IJIIP
2010
13 years 8 months ago
2010
CEC
2008
IEEE
14 years 5 months ago
2008
IEEE
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
IJMC
2006
13 years 10 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
EVOW
2004
Springer
14 years 4 months ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...