Search result for Algorithm analysis and design Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 1,086 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Algorithms: Design and Analysis, Part 2
by Tim Roughgarden- 0.0
-
![]()
![]()
![]()
![]()
![]()
6 Weeks
Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, sequence alignment, optimal search trees, shortest paths), NP-completeness and what it means for the algorithm designer, analysis of heuristics, local search. NP-completeness and what it means for the algorithm designer analysis of heuristics...
$149
RF and millimeter-Wave Circuit Design
by Carlos Mendes, Jr. , Peter Baltus- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 30 hours to complete
The course covers the topics on how to derive the RF wireless systems specifications, and how to design the main building blocks of a transceiver, i. But ultimately, this would allow students to design and build their own transceiver at home! Welcome to the RF Circuit Design Course Solution - RF Transceiver Design (calculation and validation)...
I/O-efficient algorithms
by Mark de Berg- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 10 hours to complete
These data fetches are also called I/O operations and need to be taken into account during the design of an algorithm. - Graph terminology, representations of graphs (adjacency lists and adjacency matrix), basic graph algorithms (BFS, DFS, topological sort, shortest paths) 1 and 1. Designing cache-aware and cache-oblivious algorithms A cache-aware algorithm for matrix transposition...
Algorithms in C : Concepts, Examples, Code + Time Complexity
by Engineering Mentor- 4
-
![]()
![]()
![]()
![]()
![]()
3.5 hours on-demand video
Understand Logic with examples, practice code and crack those programming interviews! What's New: Time Complexity of Merge Sort, Extended Euclidean Algorithm in Number Theory section, New section on Transform and Conquer algorithms Lectures on Heaps, heap construction and heapsort algorithm are added. Warshall's algorithm and Floyd's algorithm are explained. So take this course now and learn how to design and implement algorithms....
$11.99
Machine Learning
by Andrew NgTop Instructor- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 61 hours to complete
In the past decade, machine learning has given us self-driving cars, practical speech recognition, effective web search, and a vastly improved understanding of the human genome. (iii) Best practices in machine learning (bias/variance theory; innovation process in machine learning and AI). Simplified Cost Function and Gradient Descent Principal Component Analysis Algorithm...
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. The Ford–Fulkerson Algorithm The Edmonds–Karp Algorithm Slides and Resources on Flows in Networks The Simplex Algorithm (Optional) The Ellipsoid Algorithm...
Evaluating User Interfaces
by Loren Terveen , Haiyi Zhu , Lana Yarosh , Dr. Brent Hecht , Joseph A Konstan- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 12 hours to complete
In this course you will learn and practice several techniques for user interface evaluation. First we start with techniques that can be applied alone or in a design team, including action analysis, walkthroughs, and heuristic evaluation. Introduction to Evaluating User Interfaces and Evaluation in the UI Design Process Action Analysis: GOMS and Informal Action Analysis...
Related searches
GIS Data Formats, Design and Quality
by Nick Santos- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 28 hours to complete
You'll also work with rasters for the first time, using digital elevation models and creating slope and distance analysis products. Take GIS Data Formats, Design and Quality as a standalone course or as part of the Geographic Information Systems (GIS) Specialization. Geodatabase Features and Design Design data tables and use separating and joining data in a relational database...
VSD - Machine Intelligence in EDA/CAD
by Kunal Ghosh- 4.2
-
![]()
![]()
![]()
![]()
![]()
4 hours on-demand video
We start with Electronic design automation and what is machine learning. Then we talk about the frameworks which are available today, like general purpose, big data processing and deep-learning, and which one is suitable for design automation. He has contributed to electronic design automation domain for over 20 years learning, improvising and designing solutions....
$12.99
Bioinformatics: Introduction and Methods 生物信息学: 导论与方法
by Ge Gao 高歌, Ph.D. , Liping Wei 魏丽萍, Ph.D.- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 25 hours to complete
Alignment with Affine Gap Penalty and Calculation of Time Complexity of The Needleman-Wunsch Algorithm Supplement on Homology & Similarity, Similarity Matrix and Dot Matrix (English Subtitles) Prediction and Analysis of Noncoding RNA Prediction and Analysis of Noncoding RNA Bioinformatics Database and Software Resources New Gene Evolution Detected by Genomic Computation: Basic Concepts and Examples Evolution function analysis of DNA methyltransferase...
Previous
