===================================================================== AI-9 Group-1 Sep Oct Nov total average Monday 08:10-11:20 01 15 29 13 27 10 points points => result --------------------------------------------------------------------- Oxremyuk Danil 2.5 3.5 3 -@ o+ 9 /3 => important notes Kurgan Andrey 2.5 5 3.5 - 2.5 11 /3 => - total less than 24 will fail Medvedskij Konstantin 2.5* 4 5 4 o+ 15.5 /4 => - attendance should be /6 Mixno Egor 3.5* 3.5 2.5 3 o+ 12.5 /4 => Karinkov Anatolij 2.5 2.5 2.5 2.5 o+ 10 /4 => Radkovich Andrej - 3.5 3 3.5 o+ 10 /3 => Shumuk Alexandr 2.5 2.5 2.5 2.5? o+ 10 /4 => *--------------------------------------------------------------------- (1) All One Problem with "1" and "0" both 50 % (2) Minimization of Rustrigin function -5 < x_i < 5 in 20-D and 2-D (3) TSP with N=4,5,6,7... random location in (0,0)-(1000,1000) - create coordinates of N cities at random => calculat distance matrix => calculate distance of all the possible tours and pick up shortest one => when found N is almost too big to do the above try with evolution! (4) Lucky dog for 4 sausages at (200,200),(200,800),(800,800),(800,200) with (i) Fitness Share and/or (ii) Crowding (5) Dimension Reduction from 30 points on hypersphere surface in 8-D to 2-D space ------------------------------------ *=>09/08;@=>10/13 too late to be allowed ========================================================================================== AI-9 Group-2 Sep Oct Nov total average Monday 08:10-11:20 08 22 06 20 03 17 points points => result ------------------------------------------------------------------------------------------ Borisyuk Sergej 2.5 4 2.5 2 11 /4 => Dashkevich Aleksandr 2.5 4 2.5 - 9 /3 => Kozeko Elena 4.5 5 5 4.5 19 /4 => Kontsevich Bladislav - 5 3 4.5* 12.5 /3 => Kuznetsov Aleksandr 4 4.5 5 3 16.5+ /4 => Lavrenyuk Maksim 4.5 - 5 4 13.5 /3 => Shamshur Andrej 4.2 4.5 2.5 2.5 13.7 /4 => Pokalo Sergej - 2.5 2.5 - 5 /2 => ------------------------------------------------------------------------------------------ (1) All One Problem with "1" being 20 %; then 1% still have time (2) Lucky Dog: dogs start with (500,500) looking for one sausage at (200,800) in the troidal field (0,0)-(1000,1000) (3) y=sin^6(5*pi*x) with (i) Fitness Sharing or (ii) Crowding algorithm (4) Iterated Prisonner's Dilemma (IPD): The best evolved chromosome vs. (i) Random, (ii) Always Yes, (iii) Always No, and (iv) Tit-for-Tat Show fitness-generation 4 example game above with 12 innings with 1st 3 games being random ----- *=>10/27 ===========================================================================================