The Knapsack Problem & Genetic Algorithms – Computerphile

0
(0)

From Computerphile.

Tournament selection, roulette selection, mutation, crossover – all processes used in genetic algorithms. Dr Alex Turner explains using the Knapsack Problem.

https://www.facebook.com/computerphile
https://twitter.com/computer_phile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: https://bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran’s Numberphile. More at http://www.bradyharan.com

How useful was this post?

Click on a star to rate it!

Average rating 0 / 5. Vote count: 0

No votes so far! Be the first to rate this post.

We are sorry that this post was not useful for you!

Help us improve our content!

Tell us if mBlip should continue to feature this YouTuber's content.