Advanced Search
DSpace@MIT

Browsing Theses - Computation for Design and Optimization by Title

Research and Teaching Output of the MIT Community

Browsing Theses - Computation for Design and Optimization by Title

Sort by: Order: Results:

  • Yano, Masayuki, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2009)
    A high-order Galerkin Least-Squares (GLS) finite element discretization is combined with massively parallel implicit solvers. The stabilization parameter of the GLS discretization is modified to improve the resolution ...
  • Biddle, Jason Charles (Massachusetts Institute of Technology, 2010)
    In this thesis, we summarize our work on applications and methods for computational protein design. First, we apply computational protein design to address the problem of degradation in stored proteins. Specifically, we ...
  • Wu, Kailiang (Massachusetts Institute of Technology, 2008)
    The semiconductor industry is an exciting and challenging industry. Strong demand at the application end, plus the high capital intensity and rapid technological innovation in manufacturing, makes it difficult to manage ...
  • Chen, Daizhuo (Massachusetts Institute of Technology, 2010)
    Uncertainty in travel time is one of the key factors that could allow us to understand and manage congestion in transportation networks. Models that incorporate uncertainty in travel time need to specify two mechanisms: ...
  • Zhang, Hui, S.M. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2009)
    The purpose of this project is to incorporate a Poisson disease model into the Spatiotemporal Epidemiological Modeler (STEM) and visualize the disease spread on Google Earth. It is done through developing a Poisson disease ...
  • Wogrin, Sonja (Massachusetts Institute of Technology, 2008)
    In many settings, distributed sensors provide dynamic measurements over a specified time horizon that can be used to reconstruct information such as parameters, states or initial conditions. This estimation task can be ...
  • Coles, Thomas Michael Kyte (Massachusetts Institute of Technology, 2011)
    This thesis investigates the impact of uncertainty on the reduction and simplification of chemical kinetics mechanisms. Chemical kinetics simulations of complex fuels are very computationally expensive, especially when ...
  • Ni, Yuzhao (Massachusetts Institute of Technology, 2013)
    In this thesis, we designed and implemented a crowdsourcing system to annotate mouse behaviors in videos; this involves the development of a novel clip-based video labeling tools, that is more efficient than traditional ...
  • Kong, Tian Fook (Massachusetts Institute of Technology, 2008)
    While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to ...
  • Lin, Maokai (Massachusetts Institute of Technology, 2010)
    This thesis proposes new methods to solve three problems: 1) how to model and solve decision-making problems, 2) how to translate between a graphical representation of systems and a matrix representation of systems, and ...
  • Davis, Andrew D. (Andrew Donaldson) (Massachusetts Institute of Technology, 2012)
    The cryosphere is comprised of about 33 million km³ of ice, which corresponds to 70 meters of global mean sea level equivalent [30]. Simulating continental ice masses, such as the Antarctic or Greenland Ice Sheets, requires ...
  • Wang, Jie, S.M. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2009)
    This thesis aims to study the network of a nationwide distributor of a commodity product. As we cannot disclose the actual product for competitive reasons, we will present the research in terms of a similar, representative ...
  • Zhang, Lei (Lei Kevin), S.M. Massachusetts Institute of Technology, Computation for Design and Optimization Program. (Massachusetts Institute of Technology, 2006)
    The pricing problem in a multi-period setting is a challenging problem and has attracted much attention in recent years. In this thesis, we consider a monopoly and an oligopoly pricing problem. In the latter, several sellers ...
  • Ding, Jiachuan (Massachusetts Institute of Technology, 2007)
    In this thesis, we utilize probabilistic reasoning and simulation methods to determine the optimal selection rule for the secretary problem with switch costs, in which a known number of applicants appear sequentially in a ...
  • Fitriani (Massachusetts Institute of Technology, 2008)
    Dynamic Time and Space Warping (DTSW) is a technique used in video matching applications to find the optimal alignment between two videos. Because DTSW requires O(N4) time and space complexity, it is only suitable for short ...
  • Parno, Matthew David (Massachusetts Institute of Technology, 2011)
    The Bayesian approach to inference problems provides a systematic way of updating prior knowledge with data. A likelihood function involving a forward model of the problem is used to incorporate data into a posterior ...
  • Sundaresh, Harish Peruvamba (Massachusetts Institute of Technology, 2007)
    Prevailing Parallel Linear Algebra software block cyclically distributes data across its processors for good load balancing and communication between its nodes. The block cyclic distribution schema characterized by cyclic ...
  • Kumar, Vinay, S.M. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2007)
    A new approach is proposed for finding all solutions of systems of nonlinear equations with bound constraints. The zero finding problem is converted to a global optimization problem whose global minima with zero objective ...
  • Kedia, Kushal Sharad (Massachusetts Institute of Technology, 2010)
    The objective of this work is to develop a high efficiency two-dimensional reactive flow solver to investigate perforated-plate stabilized laminar premixed flames. The developed code is used to examine the impact of the ...
  • Peruvamba Sundaresh, Vignesh (Massachusetts Institute of Technology, 2009)
    Can you imagine doing hundreds of millions of operations on non-integers and not obtaining a single round-off error? For n < 12, the algorithm used in this thesis does exactly that. We took advantage of a floating point ...
MIT-Mirage