2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

91 - 100 of 157 results for: MS&E

MS&E 298: Hacking for Diplomacy: Tackling Foreign Policy Challenges with the Lean Launchpad (IPS 232)

At a time of significant global uncertainty, diplomats are grappling with transnational and cross-cutting challenges that defy easy solution including: the continued pursuit of weapons of mass destruction by states and non-state groups, the outbreak of internal conflict across the Middle East and in parts of Africa, the most significant flow of refugees since World War II, and a changing climate that is beginning to have impacts on both developed and developing countries. While the traditional tools of statecraft remain relevant, policymakers are looking to harness the power of new technologies to rethink how the U.S. government approaches and responds to these and other long-standing challenges. In this class, student teams will take actual foreign policy challenges and learn how to apply lean startup principles, ("mission model canvas," "customer development," and "agile engineering¿) to discover and validate agency and user needs and to continually build iterative prototypes to test whether they understood the problem and solution. Teams take a hands-on approach requiring close engagement with officials in the U.S. State Department and other civilian agencies. Team applications required at the end of shopping period. Limited enrollment.
Terms: not given this year | Units: 3-4 | Grading: Letter (ABCD/NP)

MS&E 299: Voluntary Social Systems

Ethical theory, feasibility, and desirability of a social order in which coercion by individuals and government is minimized and people pursue ends on a voluntary basis. Topics: efficacy and ethics; use rights for property; contracts and torts; spontaneous order and free markets; crime and punishment based on restitution; guardian-ward theory for dealing with incompetents; the effects of state action-hypothesis of reverse results; applications to help the needy, armed intervention, victimless crimes, and environmental protection; transition strategies to a voluntary society.
Terms: Win | Units: 1-3 | Grading: Letter or Credit/No Credit
Instructors: Howard, R. (PI)

MS&E 300: Ph.D. Qualifying Tutorial or Paper

Restricted to Ph.D. students assigned tutorials as part of the MS&E Ph.D. qualifying process. Enrollment optional.
Terms: Aut, Win, Spr, Sum | Units: 1-3 | Repeatable for credit | Grading: Satisfactory/No Credit

MS&E 301: Dissertation Research

Prerequisite: doctoral candidacy.
Terms: Aut, Win, Spr, Sum | Units: 1-15 | Repeatable for credit | Grading: Satisfactory/No Credit

MS&E 310: Linear Programming

Formulation of standard linear programming models. Theory of polyhedral convex sets, linear inequalities, alternative theorems, and duality. Variants of the simplex method and the state of art interior-point algorithms. Sensitivity analyses, economic interpretations, and primal-dual methods. Relaxations of harder optimization problems and recent convex conic linear programs. Applications include game equilibrium facility location. Prerequisite: MATH 113 or consent of instructor.
Terms: Aut | Units: 3 | Grading: Letter or Credit/No Credit

MS&E 311: Optimization (CME 307)

Applications, theories, and algorithms for finite-dimensional linear and nonlinear optimization problems with continuous variables. Elements of convex analysis, first- and second-order optimality conditions, sensitivity and duality. Algorithms for unconstrained optimization, and linearly and nonlinearly constrained problems. Modern applications in communication, game theory, auction, and economics. Prerequisites: MATH 113, 115, or equivalent.
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Ye, Y. (PI)

MS&E 312: Advanced Methods in Numerical Optimization (CME 334)

Topics include interior-point methods, relaxation methods for nonlinear discrete optimization, sequential quadratic programming methods, optimal control and decomposition methods. Topic chosen in first class; different topics for individuals or groups possible. Individual or team projects. May be repeated for credit.
Terms: not given this year | Units: 3 | Repeatable for credit | Grading: Letter or Credit/No Credit

MS&E 313: Almost Linear Time Graph Algorithms (CS 269G)

Over the past decade there has been an explosion in activity in designing new provably efficient fast graph algorithms. Leveraging techniques from disparate areas of computer science and optimization researchers have made great strides on improving upon the best known running times for fundamental optimization problems on graphs, in many cases breaking long-standing barriers to efficient algorithm design. In this course we will survey these results and cover the key algorithmic tools they leverage to achieve these breakthroughs. Possible topics include but are not limited to, spectral graph theory, sparsification, oblivious routing, local partitioning, Laplacian system solving, and maximum flow. Prerequisites: calculus and linear algebra.
Terms: not given this year | Units: 3 | Grading: Letter (ABCD/NP)

MS&E 314: Linear and Conic Optimization with Applications (CME 336)

Linear, semidefinite, conic, and convex nonlinear optimization problems as generalizations of classical linear programming. Algorithms include the interior-point, barrier function, and cutting plane methods. Related convex analysis, including the separating hyperplane theorem, Farkas lemma, dual cones, optimality conditions, and conic inequalities. Complexity and/or computation efficiency analysis. Applications to combinatorial optimization, sensor network localization, support vector machine, and graph realization. Prerequisite: MS&E 211 or equivalent.
Terms: alternate years, given next year | Units: 3 | Grading: Letter or Credit/No Credit
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints