Search result for Approximation algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 26 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Approximation Algorithms
by Mark de Berg- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
These techniques apply when we don't require the optimal solution to certain problems, but an approximation that is close to the optimal solution. - Graph terminology, representations of graphs (adjacency lists and adjacency matrix), basic graph algorithms (BFS, DFS, topological sort, shortest paths) Introduction to Approximation algorithms Introduction to Approximation Algorithms...
Approximation Algorithms Part II
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 33 hours to complete
Approximation algorithms, Part 2 This is the continuation of Approximation algorithms, Part 1. Here you will learn linear programming duality applied to the design of some approximation algorithms, and semidefinite programming applied to Maxcut. This is the second of a two-part course on Approximation Algorithms. Primal-dual algorithms Steiner Forest and Primal-Dual Approximation Algorithms Facility Location and Primal-Dual Approximation Algorithms...
Approximation Algorithms Part I
by Claire Mathieu- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 36 hours to complete
Approximation algorithms, Part I This course assumes knowledge of a standard undergraduate Algorithms course, and particularly emphasizes algorithms that can be designed using linear programming, a favorite and amazingly successful technique in this area. This is the first of a two-part course on Approximation Algorithms. Lecture: Approximation algorithm Lecture: approximation scheme...
Prediction and Control with Function Approximation
by Martha White , Adam White- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 22 hours to complete
-Understand objectives for prediction (value estimation) under function approximation -Implement TD with function approximation (state aggregation), on an environment with an infinite state space (continuous state space) -Implement TD with neural network function approximation in a continuous state environment -Understand new difficulties in exploration when moving to function approximation On-policy Prediction with Approximation...
Algorithm Design and Analysis
by Sampath Kannan- 0.0
-
![]()
![]()
![]()
![]()
![]()
4 Weeks
You will learn about algorithms that operate on common data structures, for instance sorting and searching; advanced design and analysis techniques such as dynamic programming and greedy algorithms; advanced graph algorithms such as minimum spanning trees and shortest paths; NP-completeness theory; and approximation algorithms. How to analyze the efficiency of algorithms...
$149
Matrix Methods
by Daniel Boley- 4.1
-
![]()
![]()
![]()
![]()
![]()
Approx. 7 hours to complete
Linear Least Squares: Best Approximation...
Sparse Representations in Signal and Image Processing: Fundamentals
by Michael Elad , Alona Golts- 0.0
-
![]()
![]()
![]()
![]()
![]()
5 Weeks
A series of theoretical problems arise in deploying this seemingly simple model to data sources, leading to fascinating new results in linear algebra, approximation theory, optimization, and machine learning. About sparse coding algorithms and their proven ability to perform well....
$149
Related searches
A Complete Reinforcement Learning System (Capstone)
by Martha White , Adam White- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 16 hours to complete
Let's Review: Non-linear Approximation with Neural Networks Let's Review: Expected Sarsa with Function Approximation...
C Language + Algorithms + Data Structures = Power
by Nidhal Abidi- 3.4
-
![]()
![]()
![]()
![]()
![]()
16.5 hours on-demand video
Up and running with c Programming language and algorithms and data structures will happily hire any programmer who masters C , Algorithms and Data Structure. Sorting AlgorithmsGeometric AlgorithmsMath AlgorithmsString AlgorithmsApproximation AlgorithmsTree AlgorithmsGraph AlgorithmsComplexity TheoryProblem Solving ApproachesMore Algorithms are being added continuously FOREVER....
$12.99
The Design and Analysis of Algorithm Masterclass [ 2019 ]
by Up Degree- 3.6
-
![]()
![]()
![]()
![]()
![]()
12.5 hours on-demand video
Asymptotic Notations, Recursion, Divide and Conquer, Dynamic Programming, Dijkstra's, Bellman Ford, Floyd Warshall Algorithm, Kruskal's Algorithm, Knapsack Problem, String Matching with Finite Automaton, Heap sort, Huffman Codes, n-Queens Algorithm, Rat in Maze, 0/1 Knapsack Problem, 15 Puzzle Problem, NP Completeness, Approximation Algorithms NP Completeness and Approximation Algorithms...
$16.99
