( en | de | ru )

 

Disambiguation of "Tinós, Renato"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Neuron Selection and Generalization: NK Ensemble Neural Networks

, , and . International Conference on Parallel Problem Solving from Nature, page 449--460. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Renato Hasche

Renato Pasold

Renato Meola

Renato Fassbind

Renato Strassmann

 

Other publications of authors with the same name

Tunnelling Crossover Networks., , , and . GECCO, page 449-456. ACM, (2015)Optimal Neuron Selection: NK Echo State Networks for Reinforcement Learning., , and . CoRR, (2015)Entropy-based evaluation function in a multi-objective approach for the investigation of the genetic code robustness., and . Memetic Computing, 6 (3): 157-170 (2014)Control of the number of random imigrants in genetic algorithms for protein structure prediction., and . GECCO, page 1795-1796. ACM, (2009)Self-adaptation of mutation distribution in evolution strategies for dynamic optimization problems., and . Int. J. Hybrid Intell. Syst., 8 (3): 155-168 (2011)A genetic algorithm with gene dependent mutation probability for non-stationary optimization problems., and . IEEE Congress on Evolutionary Computation, page 1278-1285. IEEE, (2004)Evolutionary programming with q-Gaussian mutation for dynamic optimization problems., and . IEEE Congress on Evolutionary Computation, page 1823-1830. IEEE, (2008)Quasi-Optimal Recombination Operator., , , and . EvoCOP, volume 11452 of Lecture Notes in Computer Science, page 131-146. Springer, (2019)Genetic Algorithm with Linkage Learning., , , and . GECCO, page 981-989. ACM, (2023)An efficient implementation of iterative partial transcription for the traveling salesman problem., , and . GECCO, page 252-260. ACM, (2021)