Description

This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms. This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.

Subjects

Randomized Algorithms | Randomized Algorithms | algorithms | algorithms | efficient in time and space | efficient in time and space | randomization | randomization | computational problems | computational problems | data structures | data structures | graph algorithms | graph algorithms | optimization | optimization | geometry | geometry | Markov chains | Markov chains | sampling | sampling | estimation | estimation | geometric algorithms | geometric algorithms | parallel and distributed algorithms | parallel and distributed algorithms | parallel and ditributed algorithm | parallel and ditributed algorithm | parallel and distributed algorithm | parallel and distributed algorithm | random sampling | random sampling | random selection of witnesses | random selection of witnesses | symmetry breaking | symmetry breaking | randomized computational models | randomized computational models | hash tables | hash tables | skip lists | skip lists | minimum spanning trees | minimum spanning trees | shortest paths | shortest paths | minimum cuts | minimum cuts | convex hulls | convex hulls | linear programming | linear programming | fixed dimension | fixed dimension | arbitrary dimension | arbitrary dimension | approximate counting | approximate counting | parallel algorithms | parallel algorithms | online algorithms | online algorithms | derandomization techniques | derandomization techniques | probabilistic analysis | probabilistic analysis | computational number theory | computational number theory | simplicity | simplicity | speed | speed | design | design | basic probability theory | basic probability theory | application | application | randomized complexity classes | randomized complexity classes | game-theoretic techniques | game-theoretic techniques | Chebyshev | Chebyshev | moment inequalities | moment inequalities | limited independence | limited independence | coupon collection | coupon collection | occupancy problems | occupancy problems | tail inequalities | tail inequalities | Chernoff bound | Chernoff bound | conditional expectation | conditional expectation | probabilistic method | probabilistic method | random walks | random walks | algebraic techniques | algebraic techniques | probability amplification | probability amplification | sorting | sorting | searching | searching | combinatorial optimization | combinatorial optimization | approximation | approximation | counting problems | counting problems | distributed algorithms | distributed algorithms | 6.856 | 6.856 | 18.416 | 18.416

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

6.854J is a first-year graduate course in algorithms, continuing where 6.046J left off. The course emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Topics include: data structures, network flows, linear programming, computational geometry, approximation algorithms. 6.854J is a first-year graduate course in algorithms, continuing where 6.046J left off. The course emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Topics include: data structures, network flows, linear programming, computational geometry, approximation algorithms.

Subjects

algorithm design and analysis | algorithm design and analysis | algorithms | algorithms | fundamental algorithms | fundamental algorithms | advanced methods of algorithmic design | advanced methods of algorithmic design | analysis | analysis | implementation | implementation | data structures | data structures | network flows | network flows | linear programming | linear programming | computational geometry | computational geometry | approximation algorithms | approximation algorithms | algorithmic design | algorithmic design | algorithmic analysis | algorithmic analysis | string algorithms | string algorithms | maximum flows | maximum flows | online algorithms | online algorithms | scheduling | scheduling | external memory algorithms | external memory algorithms | 6.854 | 6.854 | 18.415 | 18.415

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This readme file contains details of links to all the Computer Science Concepts module's material held on Jorum and information about the module as well.

Subjects

ukoer | strings lecture | induction and recursion lecture | induction lecture | recursion lecture | complexity lecture | languages lecture | computer sciences concepts test | computer science concepts test | computer science concepts assignment | computer science concepts practical | introduction | computer science concepts | computer science concept | computer science | strings and languages | strings and language | string and languages | string and language | string | language | languages | finite automata | automata | finite | push down automata | push down | prolog | data structures and algorithms | data structure and algorithms | data structures and algorithm | data structure and algorithm | data structures | data structure | algorithms | algorithm | revision exercises | revision | induction and recursion | induction | recursion | turing machines | turing machine | turing | machine | machines | complexity | grammar | grammar and languages | grammar and language | introduction lecture | computer science concepts lecture | computer science concept lecture | computer science lecture | strings and languages lecture | strings and language lecture | string and languages lecture | string and language lecture | string lecture | language lecture | finite automata lecture | automata lecture | finite lecture | push down automata lecture | push down lecture | prolog lecture | data structures and algorithms lecture | data structure and algorithms lecture | data structures and algorithm lecture | data structure and algorithm lecture | data structures lecture | data structure lecture | algorithms lecture | algorithm lecture | revision exercises lecture | revision lecture | turing machines lecture | turing machine lecture | turing lecture | machine lecture | machines lecture | computer science class test | computer science concept class test | computer science concepts class test | strings and languages class test | strings and language class test | string and languages class test | string and language class test | string class test | language class test | languages class test | introduction class test | grammar lecture | grammar and languages lecture | grammar and language lecture | computer science assignment | computer science concept assignment | strings and languages assignment | strings and language assignment | string and languages assignment | string and language assignment | string assignment | language assignment | languages assignment | finite automata class test | automata class test | finite class test | finite automata assignment | automata assignment | finite assignment | push down automata class test | push down class test | push down automata assignment | push down assignment | prolog class test | data structures and algorithms class test | data structure and algorithms class test | data structures and algorithm class test | data structure and algorithm class test | data structures class test | data structure class test | algorithms class test | algorithm class test | computer science practical | computer science concept practical | data structures and algorithms practical | data structure and algorithms practical | data structures and algorithm practical | data structure and algorithm practical | data structures practical | data structure practical | algorithms practical | algorithm practical | revision exercises class test | revision class test | induction and recursion class test | induction class test | recursion class test | induction and recursion assignment | induction assignment | recursion assignment | turing machines class test | turing machine class test | turing class test | machine class test | machines class test | turing machines assignment | turing machine assignment | turing assignment | machine assignment | machines assignment | complexity class test | grammar class test | grammar and languages class test | grammar and language class test | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. Domains include string algorithms, network optimization, parallel algorithms, computational geometry, online algorithms, external memory, cache, and streaming algorithms, and data structures. This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. Domains include string algorithms, network optimization, parallel algorithms, computational geometry, online algorithms, external memory, cache, and streaming algorithms, and data structures.

Subjects

amortization | amortization | randomization | randomization | fingerprinting | fingerprinting | word-level parallelism | word-level parallelism | bit scaling | bit scaling | dynamic programming | dynamic programming | network flow | network flow | linear programming | linear programming | fixed-parameter algorithms | fixed-parameter algorithms | approximation algorithms | approximation algorithms | string algorithms | string algorithms | network optimization | network optimization | parallel algorithms | parallel algorithms | computational geometry | computational geometry | online algorithms | online algorithms | external memory | external memory | external cache | external cache | external streaming | external streaming | data structures | data structures

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course surveys a variety of reasoning, optimization, and decision-making methodologies for creating highly autonomous systems and decision support aids. The focus is on principles, algorithms, and their applications, taken from the disciplines of artificial intelligence and operations research. Reasoning paradigms include logic and deduction, heuristic and constraint-based search, model-based reasoning, planning and execution, reasoning under uncertainty, and machine learning. Optimization paradigms include linear, integer and dynamic programming. Decision-making paradigms include decision theoretic planning, and Markov decision processes. This course is offered both to undergraduate (16.410) students as a professional area undergraduate subject, in the field of aerospace information This course surveys a variety of reasoning, optimization, and decision-making methodologies for creating highly autonomous systems and decision support aids. The focus is on principles, algorithms, and their applications, taken from the disciplines of artificial intelligence and operations research. Reasoning paradigms include logic and deduction, heuristic and constraint-based search, model-based reasoning, planning and execution, reasoning under uncertainty, and machine learning. Optimization paradigms include linear, integer and dynamic programming. Decision-making paradigms include decision theoretic planning, and Markov decision processes. This course is offered both to undergraduate (16.410) students as a professional area undergraduate subject, in the field of aerospace information

Subjects

autonomy | autonomy | decision | decision | decision-making | decision-making | reasoning | reasoning | optimization | optimization | autonomous | autonomous | autonomous systems | autonomous systems | decision support | decision support | algorithms | algorithms | artificial intelligence | artificial intelligence | a.i. | a.i. | operations | operations | operations research | operations research | logic | logic | deduction | deduction | heuristic search | heuristic search | constraint-based search | constraint-based search | model-based reasoning | model-based reasoning | planning | planning | execution | execution | uncertainty | uncertainty | machine learning | machine learning | linear programming | linear programming | dynamic programming | dynamic programming | integer programming | integer programming | network optimization | network optimization | decision analysis | decision analysis | decision theoretic planning | decision theoretic planning | Markov decision process | Markov decision process | scheme | scheme | propositional logic | propositional logic | constraints | constraints | Markov processes | Markov processes | computational performance | computational performance | satisfaction | satisfaction | learning algorithms | learning algorithms | system state | system state | state | state | search treees | search treees | plan spaces | plan spaces | model theory | model theory | decision trees | decision trees | function approximators | function approximators | optimization algorithms | optimization algorithms | limitations | limitations | tradeoffs | tradeoffs | search and reasoning | search and reasoning | game tree search | game tree search | local stochastic search | local stochastic search | stochastic | stochastic | genetic algorithms | genetic algorithms | constraint satisfaction | constraint satisfaction | propositional inference | propositional inference | rule-based systems | rule-based systems | rule-based | rule-based | model-based diagnosis | model-based diagnosis | neural nets | neural nets | reinforcement learning | reinforcement learning | web-based | web-based | search trees | search trees

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms). This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

Subjects

algorithms | algorithms | efficient algorithms | efficient algorithms | sorting | sorting | search trees | search trees | heaps | heaps | hashing | hashing | divide-and-conquer | divide-and-conquer | dynamic programming | dynamic programming | amortized analysis | amortized analysis | graph algorithms | graph algorithms | shortest paths | shortest paths | network flow | network flow | computational geometry | computational geometry | number-theoretic algorithms | number-theoretic algorithms | polynomial and matrix calculations | polynomial and matrix calculations | caching | caching | parallel computing | parallel computing | SMA 5503 | SMA 5503 | 6.046 | 6.046

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course surveys a variety of reasoning, optimization, and decision-making methodologies for creating highly autonomous systems and decision support aids. The focus is on principles, algorithms, and their applications, taken from the disciplines of artificial intelligence and operations research. Reasoning paradigms include logic and deduction, heuristic and constraint-based search, model-based reasoning, planning and execution, reasoning under uncertainty, and machine learning. Optimization paradigms include linear, integer and dynamic programming. Decision-making paradigms include decision theoretic planning, and Markov decision processes. This course is offered both to undergraduate (16.410) students as a professional area undergraduate subject, in the field of aerospace information This course surveys a variety of reasoning, optimization, and decision-making methodologies for creating highly autonomous systems and decision support aids. The focus is on principles, algorithms, and their applications, taken from the disciplines of artificial intelligence and operations research. Reasoning paradigms include logic and deduction, heuristic and constraint-based search, model-based reasoning, planning and execution, reasoning under uncertainty, and machine learning. Optimization paradigms include linear, integer and dynamic programming. Decision-making paradigms include decision theoretic planning, and Markov decision processes. This course is offered both to undergraduate (16.410) students as a professional area undergraduate subject, in the field of aerospace information

Subjects

autonomy | autonomy | decision | decision | decision-making | decision-making | reasoning | reasoning | optimization | optimization | autonomous | autonomous | autonomous systems | autonomous systems | decision support | decision support | algorithms | algorithms | artificial intelligence | artificial intelligence | a.i. | a.i. | operations | operations | operations research | operations research | logic | logic | deduction | deduction | heuristic search | heuristic search | constraint-based search | constraint-based search | model-based reasoning | model-based reasoning | planning | planning | execution | execution | uncertainty | uncertainty | machine learning | machine learning | linear programming | linear programming | dynamic programming | dynamic programming | integer programming | integer programming | network optimization | network optimization | decision analysis | decision analysis | decision theoretic planning | decision theoretic planning | Markov decision process | Markov decision process | scheme | scheme | propositional logic | propositional logic | constraints | constraints | Markov processes | Markov processes | computational performance | computational performance | satisfaction | satisfaction | learning algorithms | learning algorithms | system state | system state | state | state | search treees | search treees | plan spaces | plan spaces | model theory | model theory | decision trees | decision trees | function approximators | function approximators | optimization algorithms | optimization algorithms | limitations | limitations | tradeoffs | tradeoffs | search and reasoning | search and reasoning | game tree search | game tree search | local stochastic search | local stochastic search | stochastic | stochastic | genetic algorithms | genetic algorithms | constraint satisfaction | constraint satisfaction | propositional inference | propositional inference | rule-based systems | rule-based systems | rule-based | rule-based | model-based diagnosis | model-based diagnosis | neural nets | neural nets | reinforcement learning | reinforcement learning | web-based | web-based | search trees | search trees

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

Subjects

algorithms | algorithms | efficient algorithms | efficient algorithms | sorting | sorting | search trees | search trees | heaps | heaps | hashing | hashing | divide-and-conquer | divide-and-conquer | dynamic programming | dynamic programming | amortized analysis | amortized analysis | graph algorithms | graph algorithms | shortest paths | shortest paths | network flow | network flow | computational geometry | computational geometry | number-theoretic algorithms | number-theoretic algorithms | polynomial and matrix calculations | polynomial and matrix calculations | caching | caching | parallel computing | parallel computing | 6.046 | 6.046 | 18.410 | 18.410

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

Includes audio/video content: AV lectures. This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms). Includes audio/video content: AV lectures. This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

Subjects

algorithms | algorithms | efficient algorithms | efficient algorithms | sorting | sorting | search trees | search trees | heaps | heaps | hashing | hashing | divide-and-conquer | divide-and-conquer | dynamic programming | dynamic programming | amortized analysis | amortized analysis | graph algorithms | graph algorithms | shortest paths | shortest paths | network flow | network flow | computational geometry | computational geometry | number-theoretic algorithms | number-theoretic algorithms | polynomial and matrix calculations | polynomial and matrix calculations | caching | caching | parallel computing | parallel computing

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allavcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This is a foundation subject in modern software development techniques for engineering and information technology. The design and development of component-based software (using C# and .NET) is covered; data structures and algorithms for modeling, analysis, and visualization; basic problem-solving techniques; web services; and the management and maintenance of software. Includes a treatment of topics such as sorting and searching algorithms; and numerical simulation techniques. Foundation for in-depth exploration of image processing, computational geometry, finite element methods, network methods and e-business applications. This course is a core requirement for the Information Technology M. Eng. program. This class was also offered in Course 13 (Department of Ocean Engineering) as 13.470J. This is a foundation subject in modern software development techniques for engineering and information technology. The design and development of component-based software (using C# and .NET) is covered; data structures and algorithms for modeling, analysis, and visualization; basic problem-solving techniques; web services; and the management and maintenance of software. Includes a treatment of topics such as sorting and searching algorithms; and numerical simulation techniques. Foundation for in-depth exploration of image processing, computational geometry, finite element methods, network methods and e-business applications. This course is a core requirement for the Information Technology M. Eng. program. This class was also offered in Course 13 (Department of Ocean Engineering) as 13.470J.

Subjects

modern software development | modern software development | engineering and information technology | engineering and information technology | component-based software | component-based software | C# | C# | .NET | .NET | data structures | data structures | algorithms for modeling | algorithms for modeling | analysis | analysis | visualization | visualization | basic problem-solving techniques | basic problem-solving techniques | web services | web services | management and maintenance of software | management and maintenance of software | sorting | sorting | searching | searching | algorithms | algorithms | numerical simulation techniques | numerical simulation techniques | image processing | image processing | computational geometry | computational geometry | finite element methods | finite element methods | network methods | network methods | e-business applications | e-business applications | classes | classes | objects | objects | inheritance | inheritance | virtual functions | virtual functions | abstract classes | abstract classes | polymorphism | polymorphism | Java applications | Java applications | applets | applets | Abstract Windowing Toolkit | Abstract Windowing Toolkit | Graphics | Graphics | Threads | Threads | Java | Java | C++ | C++ | information technology | information technology | engineering | engineering | modeling algorithms | modeling algorithms | basic problem-solving | basic problem-solving | software management | software management | software maintenance | software maintenance | searching algorithms | searching algorithms | numerical simulation | numerical simulation | object oriented programming | object oriented programming | 13.470J | 13.470J | 1.124 | 1.124 | 2.159 | 2.159 | 13.470 | 13.470

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.

Subjects

Randomized Algorithms | algorithms | efficient in time and space | randomization | computational problems | data structures | graph algorithms | optimization | geometry | Markov chains | sampling | estimation | geometric algorithms | parallel and distributed algorithms | parallel and ditributed algorithm | parallel and distributed algorithm | random sampling | random selection of witnesses | symmetry breaking | randomized computational models | hash tables | skip lists | minimum spanning trees | shortest paths | minimum cuts | convex hulls | linear programming | fixed dimension | arbitrary dimension | approximate counting | parallel algorithms | online algorithms | derandomization techniques | probabilistic analysis | computational number theory | simplicity | speed | design | basic probability theory | application | randomized complexity classes | game-theoretic techniques | Chebyshev | moment inequalities | limited independence | coupon collection | occupancy problems | tail inequalities | Chernoff bound | conditional expectation | probabilistic method | random walks | algebraic techniques | probability amplification | sorting | searching | combinatorial optimization | approximation | counting problems | distributed algorithms | 6.856 | 18.416

License

Content 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

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course intends to provide a rigorous introduction to the most important research results in the area of distributed algorithms, and prepare interested students to carry out independent research in distributed algorithms. Topics covered include: design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks, process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed. Detailed information on the This course intends to provide a rigorous introduction to the most important research results in the area of distributed algorithms, and prepare interested students to carry out independent research in distributed algorithms. Topics covered include: design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks, process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed. Detailed information on the

Subjects

distributed algorithms | distributed algorithms | algorithm | algorithm | concurrent algorithms | concurrent algorithms | distributed networks | distributed networks | process synchronization | process synchronization | computational resources | computational resources | distributed consensus | distributed consensus | distributed graph algorithms | distributed graph algorithms | distributed termination | distributed termination | deadlock detection | deadlock detection | concurrency control | concurrency control | communication | communication | clock synchronization | clock synchronization | fault tolerance | fault tolerance | distributed computation | distributed computation | 6.852 | 6.852 | 18.437 | 18.437

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

6.852J / 18.437J intends to: (1) provide a rigorous introduction to the most important research results in the area of distributed algorithms, and (2) prepare interested students to carry out independent research in distributed algorithms. Topics covered include: design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks, process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed. 6.852J / 18.437J intends to: (1) provide a rigorous introduction to the most important research results in the area of distributed algorithms, and (2) prepare interested students to carry out independent research in distributed algorithms. Topics covered include: design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks, process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration is given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation are also discussed.

Subjects

distributed algorithms | distributed algorithms | algorithm | algorithm | concurrent algorithms | concurrent algorithms | distributed networks | distributed networks | process synchronization | process synchronization | computational resources | computational resources | distributed consensus | distributed consensus | distributed graph algorithms | distributed graph algorithms | distributed termination | distributed termination | deadlock detection | deadlock detection | concurrency control | concurrency control | communication | communication | clock synchronization | clock synchronization | fault tolerance | fault tolerance | distributed computation | distributed computation | 6.852 | 6.852 | 18.437 | 18.437

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

6.895 covers theoretical foundations of general-purpose parallel computing systems, from languages to architecture. The focus is on the algorithmic underpinnings of parallel systems. The topics for the class will vary depending on student interest, but will likely include multithreading, synchronization, race detection, load balancing, memory consistency, routing networks, message-routing algorithms, and VLSI layout theory. The class will emphasize randomized algorithms and probabilistic analysis, including high-probability arguments. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5509 (Theory of Parallel Systems). 6.895 covers theoretical foundations of general-purpose parallel computing systems, from languages to architecture. The focus is on the algorithmic underpinnings of parallel systems. The topics for the class will vary depending on student interest, but will likely include multithreading, synchronization, race detection, load balancing, memory consistency, routing networks, message-routing algorithms, and VLSI layout theory. The class will emphasize randomized algorithms and probabilistic analysis, including high-probability arguments. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5509 (Theory of Parallel Systems).

Subjects

parallel systems | parallel systems | parallel computing | parallel computing | algorithms | algorithms | multithreading | multithreading | synchronization | synchronization | race detection | race detection | load balancing | load balancing | memory consistency | memory consistency | routing networks | routing networks | message-routing algorithms | message-routing algorithms | VLSI layout theory | VLSI layout theory | randomized algorithms | randomized algorithms | probabilistic analysis | probabilistic analysis | high-probability arguments | high-probability arguments

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This lecture forms part of the "Data structures and algorithms" topic of the Computer Science Concepts module.

Subjects

ukoer | computer science | computer science concept | computer science concepts | data structures and algorithms | data structure and algorithms | data structures and algorithm | data structure and algorithm | data structures | data structure | algorithms | algorithm | computer science lecture | computer science concept lecture | computer science concepts lecture | data structures and algorithms lecture | data structure and algorithms lecture | data structures and algorithm lecture | data structure and algorithm lecture | data structures lecture | data structure lecture | algorithms lecture | algorithm lecture | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This class test forms part of the "Data structures and algorithms" topic of the Computer Science Concepts module.

Subjects

ukoer | computer science concepts test | computer science | computer science concept | computer science concepts | data structures and algorithms | data structure and algorithms | data structures and algorithm | data structure and algorithm | data structures | data structure | algorithms | algorithm | computer science class test | computer science concept class test | computer science concepts class test | data structures and algorithms class test | data structure and algorithms class test | data structures and algorithm class test | data structure and algorithm class test | data structures class test | data structure class test | algorithms class test | algorithm class test | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This class test forms part of the "Data structures and algorithms" topic of the Computer Science Concepts module.

Subjects

ukoer | computer science concepts test | computer science | computer science concept | computer science concepts | data structures and algorithms | data structure and algorithms | data structures and algorithm | data structure and algorithm | data structures | data structure | algorithms | algorithm | computer science class test | computer science concept class test | computer science concepts class test | data structures and algorithms class test | data structure and algorithms class test | data structures and algorithm class test | data structure and algorithm class test | data structures class test | data structure class test | algorithms class test | algorithm class test | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This practical forms part of the "Data structures and algorithms" topic of the Computer Science Concepts module.

Subjects

ukoer | computer science concepts practical | computer science | computer science concept | computer science concepts | data structures and algorithms | data structure and algorithms | data structures and algorithm | data structure and algorithm | data structures | data structure | algorithms | algorithm | computer science practical | computer science concept practical | data structures and algorithms practical | data structure and algorithms practical | data structures and algorithm practical | data structure and algorithm practical | data structures practical | data structure practical | algorithms practical | algorithm practical | Computer science | I100

License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/

Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dc

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

6.854J is a first-year graduate course in algorithms, continuing where 6.046J left off. The course emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Topics include: data structures, network flows, linear programming, computational geometry, approximation algorithms.

Subjects

algorithm design and analysis | algorithms | fundamental algorithms | advanced methods of algorithmic design | analysis | implementation | data structures | network flows | linear programming | computational geometry | approximation algorithms | algorithmic design | algorithmic analysis | string algorithms | maximum flows | online algorithms | scheduling | external memory algorithms | 6.854 | 18.415

License

Content 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

Site sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. Domains include string algorithms, network optimization, parallel algorithms, computational geometry, online algorithms, external memory, cache, and streaming algorithms, and data structures.

Subjects

amortization | randomization | fingerprinting | word-level parallelism | bit scaling | dynamic programming | network flow | linear programming | fixed-parameter algorithms | approximation algorithms | string algorithms | network optimization | parallel algorithms | computational geometry | online algorithms | external memory | external cache | external streaming | data structures

License

Content 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

Site sourced from

https://ocw.mit.edu/rss/all/mit-allsimplifiedchinesecourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. Domains include string algorithms, network optimization, parallel algorithms, computational geometry, online algorithms, external memory, cache, and streaming algorithms, and data structures.

Subjects

amortization | randomization | fingerprinting | word-level parallelism | bit scaling | dynamic programming | network flow | linear programming | fixed-parameter algorithms | approximation algorithms | string algorithms | network optimization | parallel algorithms | computational geometry | online algorithms | external memory | external cache | external streaming | data structures

License

Content 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

Site sourced from

https://ocw.mit.edu/rss/all/mit-allcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course is mainly focused on the quantitative aspects of design and presents a unifying framework called "Multidisciplinary System Design Optimization" (MSDO). The objective of the course is to present tools and methodologies for performing system optimization in a multidisciplinary design context, focusing on three aspects of the problem: (i) The multidisciplinary character of engineering systems, (ii) design of these complex systems, and (iii) tools for optimization. There is a version of this course (16.60s) offered through the MIT Professional Institute, targeted at professional engineers. This course is mainly focused on the quantitative aspects of design and presents a unifying framework called "Multidisciplinary System Design Optimization" (MSDO). The objective of the course is to present tools and methodologies for performing system optimization in a multidisciplinary design context, focusing on three aspects of the problem: (i) The multidisciplinary character of engineering systems, (ii) design of these complex systems, and (iii) tools for optimization. There is a version of this course (16.60s) offered through the MIT Professional Institute, targeted at professional engineers.

Subjects

optimization | optimization | multidisciplinary design optimization | multidisciplinary design optimization | MDO | MDO | subsystem identification | subsystem identification | interface design | interface design | linear constrained optimization fomulation | linear constrained optimization fomulation | non-linear constrained optimization formulation | non-linear constrained optimization formulation | scalar optimization | scalar optimization | vector optimization | vector optimization | systems engineering | systems engineering | complex systems | complex systems | heuristic search methods | heuristic search methods | tabu search | tabu search | simulated annealing | simulated annealing | genertic algorithms | genertic algorithms | sensitivity | sensitivity | tradeoff analysis | tradeoff analysis | goal programming | goal programming | isoperformance | isoperformance | pareto optimality | pareto optimality | flowchart | flowchart | design vector | design vector | simulation model | simulation model | objective vector | objective vector | input | input | discipline | discipline | output | output | coupling | coupling | multiobjective optimization | multiobjective optimization | optimization algorithms | optimization algorithms | tradespace exploration | tradespace exploration | numerical techniques | numerical techniques | direct methods | direct methods | penalty methods | penalty methods | heuristic techniques | heuristic techniques | SA | SA | GA | GA | approximation methods | approximation methods | sensitivity analysis | sensitivity analysis | isoperformace | isoperformace | output evaluation | output evaluation | MSDO framework | MSDO framework

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization. The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Subjects

theory | theory | algorithms | algorithms | integer optimization | integer optimization | formulations and relaxations | formulations and relaxations | algebra and geometry of integer optimization | algebra and geometry of integer optimization | algorithms for integer optimization | algorithms for integer optimization | extensions of integer optimization | extensions of integer optimization | 15.083 | 15.083

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). Approximation methods for problems involving large state spaces are also presented and discussed. This course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). Approximation methods for problems involving large state spaces are also presented and discussed.

Subjects

dynamic programming | dynamic programming | | stochastic control | | stochastic control | | mathematics | optimization | | | mathematics | optimization | | algorithms | | algorithms | | probability | | probability | | Markov chains | | Markov chains | | optimal control | optimal control | stochastic control | stochastic control | mathematics | mathematics | optimization | optimization | algorithms | algorithms | probability | probability | Markov chains | Markov chains

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata

Description

This course is a survey of analytic tools, approaches, and techniques which are useful in the design and operation of logistics systems and integrated supply chains. The material is taught from a managerial perspective, with an emphasis on where and how specific tools can be used to improve the overall performance and reduce the total cost of a supply chain. There is a strong emphasis on the development and use of fundamental models to illustrate the underlying concepts involved in both intra- and inter-company logistics operations. The following topics are covered: demand forecasting tools, inventory control algorithms, transportation operations and management, vehicle routing, scheduling, fleet dispatching algorithms and approaches, optimization of transportation carrier operations, supp This course is a survey of analytic tools, approaches, and techniques which are useful in the design and operation of logistics systems and integrated supply chains. The material is taught from a managerial perspective, with an emphasis on where and how specific tools can be used to improve the overall performance and reduce the total cost of a supply chain. There is a strong emphasis on the development and use of fundamental models to illustrate the underlying concepts involved in both intra- and inter-company logistics operations. The following topics are covered: demand forecasting tools, inventory control algorithms, transportation operations and management, vehicle routing, scheduling, fleet dispatching algorithms and approaches, optimization of transportation carrier operations, supp

Subjects

Logistics systems | Logistics systems | Supply chain management | Supply chain management | Demand planning | Demand planning | Procurement | Procurement | Inventory | Inventory | Transportation planning | Transportation planning | Reverse logistics | Reverse logistics | Flexible contracting | Flexible contracting | Postponement | Postponement | Portfolio management | Portfolio management | Dual sourcing | Dual sourcing | demand forecasting tools | demand forecasting tools | inventory control algorithms | inventory control algorithms | transportation operations | transportation operations | vehicle routing | vehicle routing | scheduling | scheduling | fleet dispatching algorithms | fleet dispatching algorithms | optimization | optimization | transportation carrier operations | transportation carrier operations | supply chain network design | supply chain network design | procurement | procurement | sourcing | sourcing | auctions | auctions | supply contracts | supply contracts | collaboration | collaboration | supply chain uncertainty | supply chain uncertainty | ESD.260 | ESD.260 | 1.260 | 1.260 | 15.770 | 15.770

License

Content 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 http://ocw.mit.edu/terms/index.htm

Site sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xml

Attribution

Click to get HTML | Click to get attribution | Click to get URL

All metadata

See all metadata