MIT OpenCourseWare: New Courses in Electrical Engineering and Computer ScienceNew courses in Electrical Engineering and Computer Science from MIT OpenCourseWare, provider of free and open MIT course materials.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science
2017-06-20T10:07:32+05:00MIT OpenCourseWare https://ocw.mit.eduen-USContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.0002 Introduction to Computational Thinking and Data Science (MIT)6.0002 is the continuation of 6.0001 Introduction to Computer Science and Programming in Python and is intended for students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems and to help students, regardless of their major, feel justifiably confident of their ability to write small programs that allow them to accomplish useful goals. The class uses the Python 3.5 programming language.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-0002-introduction-to-computational-thinking-and-data-science-fall-2016
Fall2016Grimson, EricGuttag, JohnBell, Ana2017-05-18T16:40:15+05:006.0002en-USPython 3.5Pythonmachine learningknapsack problemgreedy algorithmoptimizationweightsmodelscomputational thinkingdata sciencedynamic programmingrecursionknapsack problemexponential timestochasticrandomprobabilityindependent variablesdependent variablesmonte carlo simulationsimulationpopulation samplinglaw of large numbersvarianceconfidence intervalempirical rulestandard deviationcentral limit theoremempirical rulestandard deviationbiaserror distributionsamplingconfidence intervalerror barsnumpyscipymatplotlibpylabpythonplottinggraphingmachine learningsupervised learningcomputer modellingsignal-to-noisefeature vectorsclassification modelregression modelclassificationclassifiernearest neighborsfeature scalingdecision treesentropysupervised learningtraining dataclusteringcluster analysisunsupervised learningobjective functiondendogramstatistical fallacysystematic errorscorrelation and causationmisleading statisticsGIGOaxis truncatingstatistical fallacyextrapolationdata enhancementTexas Sharpshooter FallacyMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.453 Quantum Optical Communication (MIT)6.453 Quantum Optical Communication is one of a collection of MIT classes that deals with aspects of an emerging field known as quantum information science. This course covers Quantum Optics, Single-Mode and Two-Mode Quantum Systems, Multi-Mode Quantum Systems, Nonlinear Optics, and Quantum System Theory.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-453-quantum-optical-communication-fall-2016
Fall2016Shapiro, Jeffrey2017-03-09T13:55:43+05:006.453en-USQuantum optics: Dirac notation quantum mechanicsharmonic oscillator quantizationnumber states, coherent states, and squeezed statesradiation field quantization and quantum field propagationPrepresentation and classical fieldsLinear loss and linear amplification: Commutator preservation and the Uncertainty Principlebeam splittersphase-insensitive and phase-sensitive amplifiersQuantum photodetection: Direct detection, heterodyne detection, and homodyne detectionSecond-order nonlinear optics: Phasematched interactionsoptical parametric amplifiersgeneration of squeezed states, photon-twin beams, non-classical fourth-order interference, and polarization entanglementQuantum systems theory: optimum binary detectionquantum precision measurementsquantum cryptographyand quantum teleportationMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.0001 Introduction to Computer Science and Programming in Python (MIT)6.0001 Introduction to Computer Science and Programming in Python is intended for students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems and to help students, regardless of their major, feel justifiably confident of their ability to write small programs that allow them to accomplish useful goals. The class uses the Python 3.5 programming language.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-0001-introduction-to-computer-science-and-programming-in-python-fall-2016
Fall2016Bell, AnaGrimson, EricGuttag, John2017-01-31T16:26:04+05:006.0001en-USComputationBranchingIterationStringsGuess and checkApproximationsBisectionDecompositionAbstractionsFunctionsTuplesListsAliasingMutabilityRecursionDictionariesTestingDebuggingExceptionsAssertionsObject Oriented ProgrammingPython ClassesInheritanceProgram EfficiencySearchingSortingMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.005 Software Construction (MIT)6.005 Software Construction introduces fundamental principles and techniques of software development, i.e., how to write software that is safe from bugs, easy to understand, and ready for change. The course includes problem sets and a final project. Important topics include specifications and invariants; testing; abstract data types; design patterns for object-oriented programming; concurrent programming and concurrency; and functional programming. The 6.005 website homepage from Spring 2016, along with all course materials, is available to OpenCourseWare users.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-005-software-construction-spring-2016
Spring2016Miller, RobertGoldman, Max2017-01-31T16:23:39+05:006.005en-USSoftware ConstructionSoftware EngineeringStatic CheckingBasic JavaTestingCode ReviewVersion ControlSpecificationsDebuggingMutabilityImmutabilityRecursionAbstract Data TypesADTsInterfacesData TypesRegular Expressions and GrammarsParserGeneratorConcurrencyThread SafetyNetworkingQueuesLocksSynchronizationGUIGraphical User InterfacesMap filter reduceTeam version controlMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.881 Computational Personal Genomics: Making Sense of Complete Genomes (MIT)With the growing availability and lowering costs of genotyping and personal genome sequencing,
the focus has shifted from the ability to obtain the sequence to the ability to make sense of
the resulting information. This course is aimed at exploring the computational challenges
associated with interpreting how sequence differences between individuals lead to phenotypic
differences in gene expression, disease predisposition, or response to treatment.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-881-computational-personal-genomics-making-sense-of-complete-genomes-spring-2016
Spring2016Kellis, Manolis2017-01-10T14:15:22+05:006.881en-USGenomesNetworksEvolutioncomputational biologygenomicscomparative genomicsepigenomicsfunctional genomicsmotifsphylogenomicspersonal genomicsalgorithmsmachine learningbiologybiological datasetsproteomicssequence analysissequence alignmentgenome assemblynetwork motifsnetwork evolutiongraph algorithmsphylogeneticspythonprobabilitystatisticsentropyinformationMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.441 Information Theory (MIT)This is a graduate-level introduction to mathematics of information theory. We will cover both classical and modern topics, including information entropy, lossless data compression, binary hypothesis testing, channel coding, and lossy data compression.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-441-information-theory-spring-2016
Spring2016Polyanskiy, Yury2016-09-23T16:43:41+05:006.441en-USproperties of informationentropydivergenceinformation measuresmutual informationsufficient statisticmutual informationprobability of errorentropy ratelossless data compressionfixed-length compressionergodic sourcesuniversal compressionbinary hypothesis testinginformation projectionchannel codingachievability boundslinear codesgaussian channelsinput constraintslattice codeschannel codingenergy-per-bitsource-channel separationfeedbackforney concatenationlossy compressiondistortionmultiple-access channelrandom number generatorsource coding theoremnoisy communicationchannel coding theoremsource channel separation theorembroadcast channelsGaussian noisetime-varying channelsMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.042J Mathematics for Computer Science (MIT)This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-spring-2015
Spring2015Meyer, Albert R.Chlipala, Adam2016-09-12T14:10:48+05:006.042J18.062Jen-US6.0426.042J18.062J18.062formal logic notationproof methodsinductionsetsrelationsgraph theoryinteger congruencesasymptotic notationgrowth of functionspermutationscombinationscountingdiscrete probabilityMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.820 Fundamentals of Program Analysis (MIT)This course offers a comprehensive introduction to the field of program analysis. It covers some of the major forms of program analysis including Type Checking, Abstract Interpretation and Model Checking. For each of these, the course covers the underlying theories as well as modern techniques and applications.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-820-fundamentals-of-program-analysis-fall-2015
Fall2015Solar-Lezama, Armando2016-07-20T17:02:54+05:006.820en-USprogram analysisLambda CalculusSemanticsλlet calculusHindley-Milner type inferenceMonadsAxiomatic SemanticsDataflow AnalysisType CheckingAbstract InterpretationModel CheckingMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.047 Computational Biology (MIT)This course covers the algorithmic and machine learning foundations of computational biology combining theory with practice. We cover both foundational topics in computational biology, and current research frontiers. We study fundamental techniques, recent advances in the field, and work directly with current large-scale biological datasets.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-047-computational-biology-fall-2015
Fall2015Kellis, Manolis2016-06-23T11:39:59+05:006.0476.878HST.507en-USGenomesNetworksEvolutioncomputational biologygenomicscomparative genomicsepigenomicsfunctional genomics, motifsphylogenomicspersonal genomicsalgorithmsmachine learningbiologybiological datasetsproteomicssequence analysissequence alignmentgenome assemblynetwork motifsnetwork evolutiongraph algorithmsphylogeneticspythonprobabilitystatisticsentropyinformationMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.046J Design and Analysis of Algorithms (MIT)This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015
Spring2015Demaine, ErikDevadas, SrinivasLynch, Nancy2016-03-04T17:07:15+05:006.046J18.410Jen-USalgorithmsortingsearch treesheapshashingdivide and conquerdynamic programminggreedy algorithmsamortized analysisgraph algorithmsshortest pathsnetwork flowcryptographyMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.231 Dynamic Programming and Stochastic Control (MIT)The course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). We will consider optimal control of a dynamical system over both a finite and an infinite number of stages. This includes systems with finite or infinite state spaces, as well as perfectly or imperfectly observed systems. We will also discuss approximation methods for problems involving large state spaces. Applications of dynamic programming in a variety of fields will be covered in recitations.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-231-dynamic-programming-and-stochastic-control-fall-2015
Fall2015Bertsekas, Dimitri2016-02-25T17:51:40+05:006.231en-USdynamic programmingstochastic controlalgorithmsfinite-statecontinuous-timeimperfect state informationsuboptimal controlfinite horizoninfinite horizondiscounted problemsstochastic shortest pathapproximate dynamic programmingMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.811 Principles and Practice of Assistive Technology (MIT)6.811: Principles and Practice of Assistive Technology (PPAT) is an interdisciplinary, project-based course, centered around a design project in which small teams of students work closely with a person with a disability in the Cambridge area to design a device, piece of equipment, app, or other solution that helps them live more independently.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-811-principles-and-practice-of-assistive-technology-fall-2014
Fall2014Li, WilliamTeo, GraceMiller, Robert2016-01-04T16:10:37+05:006.811en-USassistive technologydisabilityhuman-computer interfacecognitive impairmentscreen readerhead trackereye trackeruser centered designexperimental ethicsaccessibilityelectronicsMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.858 Computer Systems Security (MIT)6.858 Computer Systems Security is a class about the design and implementation of secure computer systems. Lectures cover threat models, attacks that compromise security, and techniques for achieving security, based on recent research papers. Topics include operating system (OS) security, capabilities, information flow control, language security, network protocols, hardware security, and security in web applications.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-858-computer-systems-security-fall-2014
Fall2014Zeldovich, Nickolai2015-07-15T16:26:00+05:006.858en-UScomputer system designsecure computer systemsthreat modelcomputer systems securityoperating systemoperating system securitycapabilitiesinformation flow controllanguage securitynetwork protocolshardware securitywebweb application securitysecure web serverweb applicationMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs (MIT)6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs is a class taking a practical approach to proving problems can't be solved efficiently (in polynomial time and assuming standard complexity-theoretic assumptions like P ≠ NP). The class focuses on reductions and techniques for proving problems are computationally hard for a variety of complexity classes. Along the way, the class will create many interesting gadgets, learn many hardness proof styles, explore the connection between games and computation, survey several important problems and complexity classes, and crush hopes and dreams (for fast optimal solutions).
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-890-algorithmic-lower-bounds-fun-with-hardness-proofs-fall-2014
Fall2014Demaine, Erik2015-07-14T12:32:49+05:006.890en-USNP-completeness3SAT3-partitionHamiltonicityPSPACEEXPTIMEEXPSPACEgamespuzzlescomputationTetrisNintendoSuper Mario Bros.The Legend of ZeldaMetroidPokémonconstraint logicSudokuNikoliChessGoOthelloboard gamesinapproximabilityPCP theoremOPT-preserving reductionAPX-hardnessvertex coverSet-cover hardnessGroup Steiner treek-dense subgraphlabel coverUnique Games Conjectureindependent setfixed-parameter intractabilityparameter-preserving reductionW hierarchyclique-hardness3SUM-hardnessexponential time hypothesiscounting problemssolution uniquenessgame theoryExistential theory of the realsundecidabilityMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.438 Algorithms for Inference (MIT)This is a graduate-level introduction to the principles of statistical inference with probabilistic models defined using graphical representations. The material in this course constitutes a common foundation for work in machine learning, signal processing, artificial intelligence, computer vision, control, and communication. Ultimately, the subject is about teaching you contemporary approaches to, and perspectives on, problems of statistical inference.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-438-algorithms-for-inference-fall-2014
Fall2014Shah, Devavrat2015-04-27T14:31:51+05:006.438en-USinferencealgorithmgraphical modelfactor graphmarkov chainGaussian modelloopy belief propagationEM algorithmstatistical inferenceprobabilistic graphical modelHidden Markov modellinear dynamical systemsSum-product algorithmjunction tree algorithmForward-backward algorithmKalman filteringsmoothingVariational methodmean-field theoryMin-sum algorithmViterbi algorithmparameter estimationlearning structureMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.828 Operating System Engineering (MIT)This course studies fundamental design and implementation ideas in the engineering of operating systems. Lectures are based on a study of UNIX and research papers. Topics include virtual memory, threads, context switches, kernels, interrupts, system calls, interprocess communication, coordination, and the interaction between software and hardware. Individual laboratory assignments involve implementation of a small operating system in C, with some x86 assembly.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-828-operating-system-engineering-fall-2012
Fall2012Kaashoek, Frans2014-12-02T15:13:16+05:006.828en-USoperating systemOSUNIXvirtual memorythreadscontext switcheskernelsinterruptssystem callsinterprocess communicationCx86 assemblyprogrammingMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.857 Network and Computer Security (MIT)6.857 Network and Computer Security is an upper-level undergraduate, first-year graduate course on network and computer security. It fits within the Computer Systems and Architecture Engineering concentration.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-857-network-and-computer-security-spring-2014
Spring2014Rivest, Ronald2014-11-17T12:10:22+05:006.857en-USnetworkcomputer securitysecuritycryptographysecret-keypublic-keydigital signatureauthenticationBitcoinencryptionblock cipherscryptographic hash functionsone-time padstream ciphersblock ciphersencryptionweb browser securitybiometricsViruseselectronic votingMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (MIT)This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course. Acknowledgments Thanks to videographers Martin Demaine and Jayson Lynch.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012
Fall2012Demaine, Erik2014-08-26T08:36:16+05:006.849en-USorigamigeometryalgorithmfoldinglinkagepolyhedraseamcrease patternuniversal moleculebox pleatingtriangulationvertexedgecurved creaserigiditytensegrityhinged dissectionunfoldinggluingplatonic solidrefoldingsculpturepaper3D chaindesignMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.S096 Effective Programming in C and C++ (MIT)This course is a fast-paced introduction to the C and C++ programming languages, with an emphasis on good programming practices and how to be an effective programmer in these languages. Topics include object-oriented programming, memory management, advantages of C and C++, optimization, and others. Students are given weekly coding assignments and a final project to hone their skills. Recommended for programmers with some background and experience in other languages.This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-s096-effective-programming-in-c-and-c-january-iap-2014
January IAP2014Kessler, Andre2014-07-08T12:19:13+05:006.S096en-USprogrammingCC++structureobject-orientedcodememoryabstractionassemblystacksoftwareinheritancescopedesignenvironmentcostcode reviewprojectbest practiceMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm6.370 The Battlecode Programming Competition (MIT)This course is conducted as an artificial intelligence programming contest in Java. Students work in teams to program virtual robots to play Battlecode, a real-time strategy game. Optional lectures are provided on topics and programming practices relevant to the game, and students learn and improve their programming skills experientially. The competition culminates in a live Battlecode tournament. This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-370-the-battlecode-programming-competition-january-iap-2013
January IAP2013Mann, Maxwell2014-06-24T18:07:20+05:006.370en-USBattlecodeprogrammingartificial intelligencedistributed algorithmnetwork communicationrobotteamcodebuildstrategyplayergamepathingsearchnavigationcomputationdatastructuredebuggingbytecodemethodcostGitrepositoryswarmspawn timeheuristicsMIT OpenCourseWare https://ocw.mit.eduContent within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htm