Optimization - Lecture 3 - CS50's Introduction to Artificial Intelligence with Python 2020

preview_player
Показать описание
00:00:00 - Introduction
00:00:15 - Optimization
00:01:20 - Local Search
00:07:24 - Hill Climbing
00:29:43 - Simulated Annealing
00:40:43 - Linear Programming
00:51:03 - Constraint Satisfaction
00:59:17 - Node Consistency
01:03:03 - Arc Consistency
01:16:53 - Backtracking Search

This course explores the concepts and algorithms at the foundation of modern artificial intelligence, diving into the ideas that give rise to technologies like game-playing engines, handwriting recognition, and machine translation. Through hands-on projects, students gain exposure to the theory behind graph search algorithms, classification, optimization, reinforcement learning, and other topics in artificial intelligence and machine learning as they incorporate them into their own Python programs. By course's end, students emerge with experience in libraries for machine learning as well as knowledge of artificial intelligence principles that enable them to design intelligent systems of their own.

***

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming.

***

HOW TO SUBSCRIBE

HOW TO TAKE CS50

HOW TO JOIN CS50 COMMUNITIES

HOW TO FOLLOW DAVID J. MALAN

***

CS50 SHOP

***

LICENSE

CC BY-NC-SA 4.0
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Public License

David J. Malan
Рекомендации по теме
Комментарии
Автор

Transition from one topic to another is smooth af 👌🏻

_pawan
Автор

Thank You CS50 for this awesome series of lectures on AI.

vinaykrishnasharma
Автор

I missed some classes from University. This guy says no problem, I got you covered. Watch me and breath a sigh of relief.
Thank you,
Jawad

JawadAhmadCodes
Автор

All the best 💯 to everyone learning, let's excel in AI together

codingdidi-hindi
Автор

I have enjoyed this lecture. it might have gotten confusing at some points but i really enjoyed it

chawaphiri
Автор

examples are so helpful to understand this topic.

SherryW-sndk
Автор

01:20 :00 finally I've got recurssion, thank you so much

alexandergarcia-yokw
Автор

Your presentations is awesome. What are you using for creating them?

ltuuudu
Автор

Cómo podría, si es posible; ver los videos con subtítulos en español y sonido en inglés.
Muchas gracias.

abrarinsa
Автор

1:13:04 Why do we enqueue(queue, (Z, X))? Wouldn't, it already be a part of queue as all arcs are already a part of queue? Is it because the other arcs such as (Z, X) might have been removed earlier and need to be added again? If yes, then will this not lead to never-ending algorithm?

vivekrai
Автор

Is it possible for one variable, let's say A, to be arc consistent, without being unary consistent?

ltuuudu
Автор

Where can I obtain the source code showed in the classes?

ricardomoreira
Автор

I love his teaching style. The content however I notice is basically taken directly from the book "Artificial Intelligence: A modern approach" and honestly that books content is quite old and not that relevant anymore.

asatorftw