Seminar za računarstvo i primenjenu matematiku, 17. septembar 2013.

Naredni sastanak Seminara biće održan u utorak, 17. septembra 2013. u 14:15, soba 301f, Matematički institut SANU.

Predavač: Anton Eremeev, Discrete Optimization Laboratory, Omsk Branch of Sobolev Institute of Mathematics, Russia

Naslov predavanja: OPTIMAL RECOMBINATION IN GENETIC ALGORITHMS

Sadržaj: This talk is a survey of results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results.


 Ostavite vaš komentar 

Komentari(0)

Ostavite vaš komentar:


(opciono)
(nece biti prikazano)