{"id":10386,"date":"2019-11-23T15:04:07","date_gmt":"2019-11-23T15:04:07","guid":{"rendered":"http:\/\/blog.bachi.net\/?p=10386"},"modified":"2019-11-23T15:12:03","modified_gmt":"2019-11-23T15:12:03","slug":"mit-opencourseware","status":"publish","type":"post","link":"https:\/\/blog.bachi.net\/?p=10386","title":{"rendered":"MIT OpenCourseWare"},"content":{"rendered":"<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLUl4u3cNGP63VIBQVWguXxZZi0566y7Wf\">MIT 6.172 Performance Engineering of Software Systems, Fall 2018<\/a><\/p>\n<ol>\n<li>Introduction and Matrix Multiplication<\/li>\n<li>Bentley Rules for Optimizing Work<\/li>\n<li>Bit Hacks<\/li>\n<li>Assembly Language &#038; Computer Architecture<\/li>\n<li>C to Assembly<\/li>\n<li>Multicore Programming<\/li>\n<li>Races and Parallelism<\/li>\n<li>Analysis of Multithreaded Algorithms<\/li>\n<li>What Compilers Can and Cannot Do<\/li>\n<li>Measurement and Timing<\/li>\n<li>Storage Allocation<\/li>\n<li>Parallel Storage Allocation<\/li>\n<li>The Cilk Runtime System<\/li>\n<li>Caching and Cache-Efficient Algorithms<\/li>\n<li>Cache-Oblivious Algorithms<\/li>\n<li>Nondeterministic Parallel Programming<\/li>\n<li>Synchronization Without Locks<\/li>\n<li>Domain Specific Languages and Autotuning<\/li>\n<li>Leiserchess Codewalk<\/li>\n<li>Speculative Parallelism &#038; Leiserchess<\/li>\n<li>Tuning a TSP Algorithm<\/li>\n<li>Graph Optimization<\/li>\n<li>High Performance in Dynamic Languages<\/li>\n<\/ol>\n<p><a href=\"https:\/\/www.youtube.com\/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi\">MIT 6.034 Artificial Intelligence, Fall 2010<\/a><\/p>\n<ol>\n<li>Introduction and Scope<\/li>\n<li>Reasoning: Goal Trees and Problem Solving<\/li>\n<li>Reasoning: Goal Trees and Rule-Based Expert Systems<\/li>\n<li>Search: Depth-First, Hill Climbing, Beam<\/li>\n<li>Search: Optimal, Branch and Bound, A*<\/li>\n<li>Search: Games, Minimax, and Alpha-Beta<\/li>\n<li>Constraints: Interpreting Line Drawings<\/li>\n<li>Constraints: Search, Domain Reduction<\/li>\n<li>Constraints: Visual Object Recognition<\/li>\n<li>Introduction to Learning, Nearest Neighbors<\/li>\n<li>Learning: Identification Trees, Disorder<\/li>\n<li>Neural Nets \/ Deep Neural Nets<\/li>\n<li>Learning: Genetic Algorithms<\/li>\n<li>Learning: Sparse Spaces, Phonology<\/li>\n<li>Learning: Near Misses, Felicity Conditions<\/li>\n<li>Learning: Support Vector Machines<\/li>\n<li>Learning: Boosting<\/li>\n<li>Representations: Classes, Trajectories, Transitions<\/li>\n<li>Architectures: GPS, SOAR, Subsumption, Society of Mind<\/li>\n<li>Probabilistic Inference I<\/li>\n<li>Probabilistic Inference II<\/li>\n<li>Model Merging, Cross-Modal Coupling, Course Summary<\/li>\n<\/ol>\n<ul>\n<li>Mega-R1. Rule-Based Systems<\/li>\n<li>Mega-R2. Basic Search, Optimal Search<\/li>\n<li>Mega-R3. Games, Minimax, Alpha-Beta<\/li>\n<li>Mega-R4. Neural Nets<\/li>\n<li>Mega-R5. Support Vector Machines<\/li>\n<li>Mega-R6. Boosting<\/li>\n<li>Mega-R7. Near Misses, Arch Learning<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>MIT 6.172 Performance Engineering of Software Systems, Fall 2018 Introduction and Matrix Multiplication Bentley Rules for Optimizing Work Bit Hacks Assembly Language &#038; Computer Architecture C to Assembly Multicore Programming Races and Parallelism Analysis of Multithreaded Algorithms What Compilers Can and Cannot Do Measurement and Timing Storage Allocation Parallel Storage Allocation The Cilk Runtime System [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-10386","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/10386","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=10386"}],"version-history":[{"count":3,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/10386\/revisions"}],"predecessor-version":[{"id":10390,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=\/wp\/v2\/posts\/10386\/revisions\/10390"}],"wp:attachment":[{"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=10386"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=10386"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.bachi.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=10386"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}