1. Introduction, Optimization Problems (MIT 6.0002 Intro to Computational Thinking and Data Science)
MIT 6.0002 Introduction to Computational Thinking and Data Science, Fall 2016
View the complete course: http://ocw.mit.edu/6-0002F16
Instructor: John Guttag
Prof. Guttag provides an overview of the course and discusses how we use computational models to understand the world in which we live, in particular he discusses the knapsack problem and greedy algoriths.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 1. Introduction, Optimization Problems (MIT 6.0002 Intro to Computational Thinking and Data Science) канала MIT OpenCourseWare
View the complete course: http://ocw.mit.edu/6-0002F16
Instructor: John Guttag
Prof. Guttag provides an overview of the course and discusses how we use computational models to understand the world in which we live, in particular he discusses the knapsack problem and greedy algoriths.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Видео 1. Introduction, Optimization Problems (MIT 6.0002 Intro to Computational Thinking and Data Science) канала MIT OpenCourseWare
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
2. Optimization Problems2020's Biggest Breakthroughs in Math and Computer Science1. What is Computation?2. Money, Ledgers & BitcoinIntroduction to Optimization: What Is Optimization?Computational Thinking & Scratch - Intro to Computer Science - Harvard's CS50 (2018)MIT 6.S191 (2020): Introduction to Deep LearningConvex Optimization: An Overview by Stephen Boyd: The 3rd Wook Hyun Kwon Lecture4. Stochastic ThinkingNobel Lecture: Jennifer Doudna, Nobel Prize in Chemistry 20206. Monte Carlo SimulationProgramming Intro - How to Self Study CodingIntroduction to Data ScienceMIT Godel Escher Bach Lecture 11. Introduction, Financial Terms and ConceptsComputational Thinking11. Introduction to Machine Learning19. Dynamic Programming I: Fibonacci, Shortest Paths