444 search results - page 22 / 89 » Solving Mastermind Using Genetic Algorithms |
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
IJON
2008
13 years 8 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
JCIT
2010
13 years 3 months ago
2010
Sensor deployment is a critical issue, as it affects the cost and detection capabilities of a wireless sensor network. Although many previous efforts have addressed this issue, mo...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
SIGADA
2004
Springer
14 years 1 months ago
2004
Springer
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...