English
Continuous Gray Code Optimization. A simple yet effective evolution algorithm. For parameters in the domain -1 to 1 the mutation operator is random add or subtract (+-) 2*exp(-precision*rnd()). Where rnd() returns a random number between 0 and 1 from the uniform distribution. Precision is a positive number usually from about 15 upward, depending on the problem.
Accedi al tuo account gratuito per leggere, scaricare EPUB o ascoltare.