Семинар за рачунарство и примењену математику, 17. септембар 2013.

• 16. Септембар, 2013
• Коментари (0)

Наредни састанак Семинара биће одржан у уторак, 17. септембра 2013. у 14:15, соба 301ф, Математички институт САНУ.

Предавач: Anton Eremeev, Discrete Optimization Laboratory, Omsk Branch of Sobolev Institute of Mathematics, Russia

Наслов предавања: OPTIMAL RECOMBINATION IN GENETIC ALGORITHMS

Садржај: 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.