2. Optimization Problems

greedy algorithm

brute force algorithm

search tree

dynamic programming

recursion

overlapping subproblems

knapsack problem

exponential time

Автор: MIT OpenCourseWare

Загружено: 19 мая 2017 г.

Просмотров: 236 947 просмотров

Описание:

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 explains dynamic programming and shows some applications of the process.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

2. Optimization Problems

Доступные форматы для скачивания:

Скачать видео mp4

Информация по загрузке:

Скачать аудио mp3

Похожие видео

3. Graph-theoretic Models

3. Graph-theoretic Models

1. Introduction, Optimization Problems (MIT 6.0002 Intro to Computational Thinking and Data Science)

1. Introduction, Optimization Problems (MIT 6.0002 Intro to Computational Thinking and Data Science)

11. Introduction to Machine Learning

11. Introduction to Machine Learning

Лучший Гайд по Kafka для Начинающих За 1 Час

Лучший Гайд по Kafka для Начинающих За 1 Час

The Art of Linear Programming

The Art of Linear Programming

How do Graphics Cards Work? Exploring GPU Architecture

How do Graphics Cards Work? Exploring GPU Architecture

6. Monte Carlo Simulation

6. Monte Carlo Simulation

What Is Mathematical Optimization?

What Is Mathematical Optimization?

If you're a lazy but ambitious student, please watch this video.

If you're a lazy but ambitious student, please watch this video.

ADHD Relief Music: Studying Music for Better Concentration and Focus, Study Music

ADHD Relief Music: Studying Music for Better Concentration and Focus, Study Music