Brest State Technical University, Course "Contemporary Intelligent Information Technology (CIIT)"

From Students' Works (2013)

All One Problem (with 1000 binary genes, assuming 1 is good gene while 0 is not. Each population includes 100 such chromosomes)

• With 1 being only 0.1% ... By Evhuh Alexandr (2013).
  => Quite amazingly it evolves to all "1" chromosome though it takes longer generation.
  
  

Function Minimization Problem => serch for the point of minimum value of y

• 20-dimensional Sphere Model: y = (x1)^2 + (x2)^2 + ... + (x20)^2

• 2-dimensional Sphere Model: y = x^2 ... By Galina-Bezabrazova
  => It seemed easy to find a minimum, that is (0,0). The algorithm found it at 10-th generation.
  
  
  

• The other 2-D function: y = x^4 - 5 x^3 - 6 x^2 + 8x + 15
• points on the graph along an evolution ... By Kalybski Vasili
  
  
  

Training Neural Networks

• Feedforward NN with 5-5-1 architecture to solve 5-even-parity Problem

• Feedforward NN with 5-5-1 architecture to recognize Palyndrome

A navigation in a gridworld - find a lucky dog!


• Starting from the center of the world searching for a sausage
  
  
  
  routes of 6 dogs at the 1st generation ... By Boiko Svetlana (Left)
  
  routes of a lucky dog and un unlucky one at the beginning ... By Danilchuk Raman (Center)
  routes of the cleverest dog at the final generation - from Home to Sausage ... By Vasili Brutsky (Right)
  (=> This looks like a graph of evolution but this is not. This is a trace of luckiest dog from home to sausage.)