Download presentation

Presentation is loading. Please wait.

Published byJason Lane Modified over 4 years ago

1
Exercise 1 Francesco Abate Niccolo` Battezzati Miguel Kaouk Apprendimento mimetico

2
EP – Program Flow Generate first population Generate new population by mutation Selection by tournament Goal? Max iterations? END μ μ q q σ, c.MAX_ITER μ + μ YES NO Fitness evaluation

3
EP – Program Architecture ep.conf EvoConfigParser EvoConfigurator main EvoAgent ( float x[D] ) float evaluate_fitness(float (*fitnessFnc)(EvoAgent *)) bool termination(bool (*terminationFnc)(EvoAgent *))

4
Experimental results μ q mean # of fitness evaluations σ = 0.8σ = 1.0σ = 2.5 10 n.s.237946379698 100 10n.s.227399560768 50n.s.2088101712028 D = 2, static σ

5
Experimental results μ mean # of fitness evaluations q = 10q = 50 103050/ 1001863330033 10006166656000 D = 2, dynamic σ

6
Experimental results μ mean # of fitness evaluations mean # of generations q = 10q = 50 10508475084// 10026431026423109203109 10002008700200816612001661 D = 5, dynamic σ

7
Experimental results μ mean # of fitness evaluations q = 10q = 50 10140058/ 100851783823050 100055675006165000 D = 10, dynamic σ

Similar presentations

OK

Exploring Genetic Algorithms Through the Iterative Prisoner's Dilemma Computer Systems Lab 2007-2008 Aaron Dufour.

Exploring Genetic Algorithms Through the Iterative Prisoner's Dilemma Computer Systems Lab 2007-2008 Aaron Dufour.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google