In this course you will learn several fundamental principles of advanced algorithm design: greedy algorithms and applications; dynamic programming and applications; NP-completeness and what it means for the algorithm designer; the design and analysis of heuristics; and more.

In this course you will learn several fundamental principles of advanced algorithm design. You'll learn the greedy algorithm design paradigm, with applications to computing good network backbones (i.e., spanning trees) and good codes for data compression. You'll learn the tricky yet widely applicable dynamic programming algorithm design paradigm, with applications to routing in the Internet and sequencing genome fragments. You’ll learn what NP-completeness and the famous “P vs. NP” problem mean for the algorithm designer. Finally, we’ll study several strategies for dealing with hard (i.e., NP-complete problems), including the design and analysis of heuristics. Learn how shortest-path algorithms from the 1950s (i.e., pre-ARPANET!) govern the way that your Internet traffic gets routed today; why efficient algorithms are fundamental to modern genomics; and how to make a million bucks in prize money by “just” solving a math problem!**Will I get a statement of accomplishment after completing this class?**Yes. Students who successfully complete the class will receive a statement of accomplishment signed by the instructor.**What is the format of the class?**The class consists of lecture videos, which are broken into small chunks, usually between eight and twelve minutes each. Some of these may contain integrated quiz questions. There will also be standalone quizzes that are not part of video lectures. There will be approximately two hours worth of video content per week.**What should I know to take this class?**How to program in at least one programming language (like C, Java, or Python); familiarity with proofs, including proofs by induction and by contradiction; and some discrete probability, like how to compute the probability that a poker hand is a full house. At Stanford, a version of this course is taken by sophomore, junior, and senior-level computer science majors. While Part 2 is designed for students who have already taken Part 1, some students have successfully completed Part 2 without taking Part 1.

会期:

- 2015年3月16日, 6 星期
- 2014年6月30日, 6 星期
- 2013年9月02日, 6 星期
- 2012年12月03日, 8 星期

已经在列表:

Algorithms

Algorithms and data structures from the beginning to advanced analysis.

Algorithms and data structures from the beginning to advanced analysis.

Алгоритмизация вычислений

1 курс МИЭМ ВШЭ, 4 кредита

1 курс МИЭМ ВШЭ, 4 кредита

还有这个题目的:

Analysis of Algorithms

This course teaches a calculus that enables precise quantitative predictions...

This course teaches a calculus that enables precise quantitative predictions...

Introduction to Algorithms (Spring 2008)

This course provides an introduction to mathematical modeling of computational...

This course provides an introduction to mathematical modeling of computational...

Computing and Data Analysis for Environmental Applications

This subject is a computer-oriented introduction to probability and data analysis...

This subject is a computer-oriented introduction to probability and data analysis...

Economic Applications of Game Theory

Game Theory, also known as Multiperson Decision Theory, is the analysis of situations...

Game Theory, also known as Multiperson Decision Theory, is the analysis of situations...

Discrete Optimization

Tired of solving Sudokus by hand? This class teaches you how to solve complex...

Tired of solving Sudokus by hand? This class teaches you how to solve complex...

还有标题«计算机科学»:

CS 282: Principles of Operating Systems II: Systems Programming for Android

Developing high quality distributed systems software is hard; developing high...

Developing high quality distributed systems software is hard; developing high...

Ruby on Rails Tutorial: Learn From Scratch

This post is part of our “Getting Started” series of free text tutorials on...

This post is part of our “Getting Started” series of free text tutorials on...

NYU Course on Deep Learning (Spring 2014)

Lectures from the NYU Course on Deep Learning (Spring 2014) This is a graduate...

Lectures from the NYU Course on Deep Learning (Spring 2014) This is a graduate...

C++ Grandmaster Certification

The C++ Grandmaster Certification is an online course in which participants...

The C++ Grandmaster Certification is an online course in which participants...

Computational Chemistry (CHEM 4021/8021)

Modern theoretical methods used in study of molecular structure, bonding, and...

Modern theoretical methods used in study of molecular structure, bonding, and...

还有Coursera:

First Year Teaching (Secondary Grades) - Success from the Start

Success with your students starts on Day 1. Learn from NTC's 25 years developing...

Success with your students starts on Day 1. Learn from NTC's 25 years developing...

Understanding 9/11: Why Did al Qai’da Attack America?

This course will explore the forces that led to the 9/11 attacks and the policies...

This course will explore the forces that led to the 9/11 attacks and the policies...

Aboriginal Worldviews and Education

This course will explore indigenous ways of knowing and how this knowledge can...

This course will explore indigenous ways of knowing and how this knowledge can...

Analytic Combinatorics

Analytic Combinatorics teaches a calculus that enables precise quantitative...

Analytic Combinatorics teaches a calculus that enables precise quantitative...

Accountable Talk®: Conversation that Works

Designed for teachers and learners in every setting - in school and out, in...

Designed for teachers and learners in every setting - in school and out, in...

© 2013-2019