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

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

Author: Denis Korolev
Course
Description
Dates
1
Vyyjayfzd3pynkssdhnqwcrx4bk4ennc1-ren956ujr2e1pya9umefxe-z08yngaz4nptzjr4nqcte0whwul=s0#w=1724&h=1060
Vyyjayfzd3pynkssdhnqwcrx4bk4ennc1-ren956ujr2e1pya9umefxe-z08yngaz4nptzjr4nqcte0whwul=s0#w=1724&h=1060
Learn tools and techniques that will help you recognize when problems you encounter are intractable and when there an efficient solution.
Free schedule
2
6-006f11
6-006f11
Prof. Erik Demaine
MIT OpenCourseWare
Computer Science
Gb Free
Course added: long ago
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance...
Free schedule
Favored by 1 person
3
6-046jf05
6-046jf05
Prof. Charles Leiserson
MIT OpenCourseWare
Mathematics, Statistics and Data Analysis
Gb Free
Course added: long ago
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational...
Free schedule
Favored by 2 people
4
Extpicture
Extpicture
М.Г. Фуругян
ИНТУИТ
Computer Science
Ru Free
Course added: long ago
Рассматриваются некоторые теоретические проблемы, возникающие при разработке математического обеспечения вычислительных систем. Изучаются такие фундаментальные проблемы, как теория потоков в сетях, анализ сложности алгоритмов и сложности дискретных задач. Рассмотрены методы решения переборных задач....
Free schedule
Favored by 1 person
5
Small-icon.hover
Small-icon.hover
Tim Roughgarden
Stanford University
Computer Science
Gb Free
Course added: long ago
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...
16 March 2015, 6 weeks
Favored by 4 people
6
Small-icon.hover
Small-icon.hover
Kevin Wayne and Robert Sedgewick
Princeton University
Computer Science Engineering & Technology
Gb Free
Course added: long ago
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers basic iterable data types, sorting, and searching algorithms. An introduction...
22 January 2016, 6 weeks
Favored by 12 people
7
Small-icon.hover
Small-icon.hover
Kevin Wayne and Robert Sedgewick
Princeton University
Computer Science Engineering & Technology
Gb Free
Course added: long ago
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part II covers graph-processing algorithms, including minimum spanning tree and shortest...
16 March 2016, 6 weeks
Favored by 4 people
8
Discreetoptimisation_logo
Discreetoptimisation_logo
Professor Pascal Van Hentenryck
The University of Melbourne
Computer Science
Gb Free
Course added: long ago
Tired of solving Sudokus by hand? This class teaches you how to solve complex search problems with discrete optimization concepts and algorithms, including constraint programming, local search, and mixed-integer programming. Optimization technology is ubiquitous in our society. It schedules planes and...
4 March 2015, 9 weeks
Favored by 5 people
9
Principles_of_computing_final
Principles_of_computing_final
Rice University
Computer Science Engineering & Technology
Gb Paid Free
Course added: 24 January 2015
This two-part course introduces the basic mathematical and programming principles that underlie much of Computer Science. Students will refine their programming skills as well as learn the basics of creating efficient solutions to common computational problems. This two-part course (part 1 is available...
20 February 2016, 4 weeks
10
Algth_logo
Algth_logo
Rice University
Computer Science Engineering & Technology
Gb Paid Free
Course added: 24 January 2015
Experienced Computer Scientists analyze and solve computational problems at a level of abstraction that is beyond that of any particular programming language. This two-part class is designed to train students in the mathematical concepts and process of "Algorithmic Thinking", allowing them to build simpler...
20 February 2016, 4 weeks
11
Small-icon.hover
Small-icon.hover
Tim Roughgarden
Stanford University
Computer Science
Gb Free
Course added: long ago
In this course you will learn several fundamental principles of algorithm design: divide-and-conquer methods, graph algorithms, practical data structures (heaps, hash tables, search trees), randomized algorithms, and more. In this course you will learn several fundamental principles of algorithm design...
5 October 2015, 6 weeks
Favored by 4 people
12
Aofa-logo
Aofa-logo
This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures...
4 March 2016, 6 weeks
Favored by 5 people
13
460_259_logo
460_259_logo
Learn the concepts and methods of linear algebra, and how to use them to think about computational problems arising in computer science. Coursework includes building on the concepts to write small programs and run them on real data. When you take a digital photo with your phone or transform the image...
2 February 2015, 10 weeks
Favored by 1 person

© 2013-2019