Search result for Algorithms Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 103 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Overview of Advanced Methods of Reinforcement Learning in Finance
by Igor Halperin- 3.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 13 hours to complete
In the last course of our specialization, Overview of Advanced Methods of Reinforcement Learning in Finance, we will take a deeper look into topics discussed in our third course, Reinforcement Learning in Finance. Finally, we will overview trending and potential applications of Reinforcement Learning for high-frequency trading, cryptocurrencies, peer-to-peer lending, and more....
Artificial Intelligence Data Fairness and Bias
by Brent Summers- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 6 hours to complete
In this course, we will explore fundamental issues of fairness and bias in machine learning. As predictive models begin making important decisions, from college admission to loan decisions, it becomes paramount to keep models from making unfair predictions. From human bias to dataset awareness, we will explore many aspects of building more ethical models....
VLSI CAD Part II: Layout
by Rob A. Rutenbar- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 24 hours to complete
You should complete the VLSI CAD Part I: Logic course before beginning this course. A modern VLSI chip is a remarkably complex beast: billions of transistors, millions of logic gates deployed for computation and control, big blocks of memory, embedded blocks of pre-designed functions designed by third parties (called “intellectual property” or IP blocks)....
Geometric Algorithms
by Kevin Buchin- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
Course Information: In many areas of computer science such as robotics, computer graphics, virtual reality, and geographic information systems, it is necessary to store, analyze, and create or manipulate spatial data. This course deals with the algorithmic aspects of these tasks: we study techniques and concepts needed for the design and analysis of geometric algorithms and data structures....
Delivery Problem
by Alexander S. Kulikov- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
We’ll implement (in Python) together efficient programs for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly?...
Advanced Algorithms and Complexity
by Alexander S. Kulikov , Michael Levin , Daniel M Kane , Neil Rhodes- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
You've learned the basic algorithms now and are ready to step into the area of more complex problems and algorithms to solve them. Advanced algorithms build upon basic ones and use new ideas. We then proceed to linear programming with applications in optimizing budget allocation, portfolio optimization, finding the cheapest diet satisfying all requirements and many others....
Genome Assembly Programming Challenge
by Alexander S. Kulikov , Michael Levin , Pavel Pevzner , Neil Rhodes- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
In Spring 2011, thousands of people in Germany were hospitalized with a deadly disease that started as food poisoning with bloody diarrhea and often led to kidney failure. It was the beginning of the deadliest outbreak in recent history, caused by a mysterious bacterial strain that we will refer to as E....
What is “the mind” and what is artificial intelligence?
by David Quigley- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 8 hours to complete
In this course, we will explore the history of cognitive science and the way these ideas shape how we think of artificial cognition. Introduction The Lure and Eeriness of Machine Life Introduction Tests and Thought Experiments The Turing Test Please excuse video interference "Computing Machinery and Intelligence" by A. M. Turing...
Advanced Data Structures in Java
by Leo Porter , Mia Minnes , Christine Alvarado- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 29 hours to complete
How does Google Maps plan the best route for getting around town given current traffic conditions? How does an internet router forward packets of network traffic to minimize delay? How does an aid group allocate resources to its affiliated local partners? To solve such problems, we first represent the key pieces of data in a complex data structure....
I/O-efficient algorithms
by Mark de Berg- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 10 hours to complete
Operations on data become more expensive when the data item is located higher in the memory hierarchy. An operation on data in CPU registers is roughly a million times faster than an operation on a data item that is located in external memory that needs to be fetched first. Prerequisites: - O-notation, Ω-notation, Θ-notation; how to analyze algorithms...
Previous
