Searching the World's top universities for courses with:

Harvard - Advanced Computer Architecture

Covers technology trends in computer system design, with an emphasis on power-aware computing for mobile, embedded, and traditional systems. System design areas include implementation, architecture, system software, and applications.
Score: 6.7581983 Details | Listing | Web page

Harvard - Advanced Design of VLSI Circuits and Systems

The contents and course requirements are similar to those of Computer Science 148, with the exception that students enrolled in Computer Science 248 are expected to do a substantial design project and paper discussions on advanced topics.
Score: 6.7581983 Details | Listing | Web page

Harvard - Advanced Topics in Programming Languages

Examines use of programming languages to build secure, efficient, and reliable systems. Language-based security, domain-specific languages, language support for distributed systems, language abstractions for concurrency. Students read and present research papers, undertake a research project.
Score: 6.7581983 Details | Listing | Web page

Harvard - Algorithms at the Ends of the Wire

Covers topics related to algorithms for big data, especially related to networks. Themes include compression, cryptography, coding, and information retrieval related to the World Wide Web. Requires a major final project.
Score: 6.7581983 Details | Listing | Web page

Harvard - Artificial Intelligence: Reasoning and Planning Systems

In-depth study of artificial intelligence techniques for reasoning, planning, and learning. Topics vary from year to year.
Score: 6.7581983 Details | Listing | Web page

Harvard - Biologically-Inspired Distributed and Multi-Agent Systems

Surveys biologically-inspired approaches to designing distributed systems. Focus is on algorithms, analysis, and programming paradigms. Topics: swarm intelligence, amorphous computing, immune-inspired systems, synthetic biology. Discussion of research papers and a research project required.
Score: 6.7581983 Details | Listing | Web page

Harvard - Biologically-Inspired Multi-Agent Systems, Distributed Systems, and Computational Biology

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Biologically-Inspired Multi-Agent Systems, Distributed Systems, and Computational Biology

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Biologically-Inspired Multi-Agent Systems, Distributed Systems, and Computational Biology

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Biologically-Inspired Multi-Agent Systems, Distributed Systems, and Computational Biology

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Collaborative Systems, AI Planning, and Natural Language Processing

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Collaborative Systems, AI Planning, and Natural Language Processing

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Collaborative Systems, AI Planning, and Natural Language Processing

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Collaborative Systems, AI Planning, and Natural Language Processing

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Compilers

Implementation of efficient interpreters and compilers for programming languages. Associated algorithms and pragmatic issues. Emphasizes practical applications including those outside of programming languages proper. Also shows relationships to programming-language theory and design. Participants build a working compiler including lexical analysis, parsing, type checking, code generation, and register allocation. Exposure to run-time issues and optimization.
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity

A quantitative theory of the resources needed for computing and the impediments to efficient computation. The models of computation considered include ones that are finite or infinite, deterministic, randomized, quantum or nondeterministic, discrete or algebraic, sequential or parallel.
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Cryptography, and Pseudorandomness

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Cryptography, and Pseudorandomness

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Cryptography, and Pseudorandomness

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Cryptography, and Pseudorandomness

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Parallel Computation, Computational Learning, Neural Computation

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Parallel Computation, Computational Learning, Neural Computation

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Parallel Computation, Computational Learning, Neural Computation

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Complexity, Parallel Computation, Computational Learning, Neural Computation

null
Score: 6.7581983 Details | Listing | Web page

Harvard - Computational Learning Theory

Possibilities of and limitations to performing learning by computational agents. Topics include computational models, polynomial time learnability, learning from examples and learning from queries to oracles. Applications to Boolean functions, automata and geometric functions.
Score: 6.7581983 Details | Listing | Web page

1 - 25 26 - 50 51 - 75 76 - 100 101 - 125 126 - 141