This page provides quick links to lecture notes that I have written for various classes: CS254: A graduate class on computational complexity (Stanford) [Spring 2010 Class Home Page] [Notes for Lectures 1-8] CS278: A graduate class on computational complexity (Berkeley) [Spring 2001 Class Home Page] [Fall 2002 Class Home Page] [2001 Lecture Notes in book…
This course introduces students to probability and random variables. Topics include distribution functions, binomial, geometric, hypergeometric, and Poisson distributions. The other topics covered are uniform, exponential, normal, gamma and beta distributions; conditional probability; Bayes theorem; joint distributions; Chebyshev inequality; law of large numbers; and central limit theorem.
- ARM Research
- Hound: Causal Learning for Datacenter-scale Straggler Diagnosis
- Adaptive Resource Management for Mobile CMPs through Self-awareness
- On-the-fly deterministic binary filters and other on-going work in Machine Learning Systems
- Managed Modularity for Deep Neural Networks
The PUNLAG seminar is intended to supplement the numerical linear algebra course sequence at Purdue. The standard course CS515 doesn't have room for a number of interesting problems -- we hope to cover some in this seminar!
This archive holds videos of past Fields lectures. Lectures are archived in two formats.The interactive format, viewed in a flash-player-enabled desktop web browser, allows you to zoom in and out on specific areas of the blackboards or screens (providing a viewing experience more like being present in the room). The static format, although it does not allow for zooming in to read small blackboard writing, is downloadable and compatible with a wide variety of desktop and mobile video players.
Here's a list of the eighteen best, quirkiest, and most informative artificial intelligence bugs available on YouTube we've collected over the past 12 months. In the spirit of AiGameDev.com, you'll find a bunch of tips & tricks to help fix these problems when/if you see them in your own game. First, a disclaimer. While certainly fun, this is also a difficult feature for me to write; the draft has been waiting to be finished up and published for over 6 months. There are already many video collections of AI bugs on also-ran Game News sites, but the difference here is that I've personally met or worked online with most of the developers behind these games — and many of them read this blog (RSS). I'm hoping the controversial aspect of this article is overshadowed by the useful analysis and the importance of the topic. The fact is, if you look beyond the sensationalist headline, social media websites are dramatically changing the way games are received by gamers and the community at large. And AI in games is no exception here... In fact, there seems to be increasingly more pressure and scrutiny on the behavior of game characters. Luckily, this new area of social media means there's also lots to learn from!
- survey several important computational problems for which the traditional worst-case analysis of algorithms is ill-suited
- study systematically alternatives to worst-case analysis
The textbook An Introduction to the Analysis of Algorithms by Robert Sedgewick and Phillipe Flajolet overviews the primary techniques used in the mathematical analysis of algorithms.
The textbook Analytic Combinatorics by Philippe Flajolet and Robert Sedgewick enables precise quantitative predictions of the properties of large combinatorial structures.
Learn to make the most of the tools that hackers have been using for decades.
As hackers, we spend a lot of time on our computers, so it makes sense to make that experience as fluid and frictionless as possible. In this class, we’ll help you learn how to make the most of tools that productive programmers use.
We’ll show you how to navigate the command line, use a powerful text editor, use version control efficiently, automate mundane tasks, manage packages and software, configure your desktop environment, and more.
- Special Relativity
- Quantum Theory
- Quantum Mechanics
- Quantum-Mechanical Theory of Atoms
- Chemical Bonds and Solid-State Physics
- Nuclear Physics
- Particle Physics
- Atomic Structure and Molecules
- Kinetic Molecular Theory and Chemical Reactions
- Thermodynamics
- Calorimetry and Colligative Properties
- Solutions, Solvents and Solubility
- Acid and Base Reactions
- Electrochemistry
- Cell Structure and Viruses
- Enzyme Activity and Cell Respiration
- Cell Cycle, Reproduction and Embryology
- Genetics
- Nervous and Musculoskeletal System
- Endocrine System
- Digestive and Excretory Systems
- Cardiovascular and Respiratory Systems
- Immune System
Filmbesprechungen, filmpädagogische Begleitmaterialien, News, Termine, Veranstaltungen, Adressen und Links für die schulische und außerschulische Filmarbeit.
This course covers the design and implementation of distributed systems. Students will gain an understanding of the principles and techniques behind the design of modern, reliable, and high-performance distributed systems. Topics include server design, network programming, naming, concurrency and locking, consistency models and techniques, security, and fault tolerance. Modern techniques and systems employed at some of the largest Internet sites (e.g., Google, Facebook, Amazon) will also be covered. Through programming assignments, students will gain practical experience designing, implementing, and debugging real distributed systems.
R. Feynman, и J. Cline. (2020)cite arxiv:2006.08594Comment: 98 pages, 117 figures; Feynman's personal course notes and audio files for lectures 15, 17, 18 available at http://www.physics.mcgill.ca/~jcline/Feynman/.