Advanced Search
DSpace@MIT

Browsing Electrical Engineering and Computer Sciences - Ph.D. / Sc.D. by Title

Research and Teaching Output of the MIT Community

Browsing Electrical Engineering and Computer Sciences - Ph.D. / Sc.D. by Title

Sort by: Order: Results:

  • Heinzelman, Wendi Beth, 1973- (Massachusetts Institute of Technology, 2000)
    In recent years, advances in energy-efficient design and wireless technologies have enabled exciting new applications for wireless devices. These applications span a wide range, including real-time and streaming video and ...
  • LaCurts, Katrina L. (Katrina Leigh) (Massachusetts Institute of Technology, 2014)
    Cloud computing has become popular in recent years. Companies such as Amazon and Microsoft host large datacenters of networked machines available for users to rent. These users are varied: from individual researchers to ...
  • Tedrake, Russell L., 1977- (Massachusetts Institute of Technology, 2004)
    Online learning and controller adaptation will be an essential component for legged robots in the next few years as they begin to leave the laboratory setting and join our world. I present the first example of a learning ...
  • Nadakuditi, Rajesh Rao (Massachusetts Institute of Technology, 2006)
    The first part of the dissertation investigates the application of the theory of large random matrices to high-dimensional inference problems when the samples are drawn from a multivariate normal distribution. A longstanding ...
  • Afergan, Michael Moïse (Massachusetts Institute of Technology, 2005)
    This thesis presents repeated game analysis as an important and practical tool for networked application and protocol designers. Incentives are a potential concern for a large number of networked applications. Well-studied ...
  • Chang, Yu-Han, Ph. D., Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2005)
    Systems involving multiple autonomous entities are becoming more and more prominent. Sensor networks, teams of robotic vehicles, and software agents are just a few examples. In order to design these systems, we need methods ...
  • Valenti, Mario J. (Mario James), 1976- (Massachusetts Institute of Technology, 2007)
    This thesis presents the development and implementation of approximate dynamic programming methods used to manage multi-agent systems. The purpose of this thesis is to develop an architectural framework and theoretical ...
  • Malioutov, Dmitry M., 1981- (Massachusetts Institute of Technology, 2008)
    The focus of this thesis is approximate inference in Gaussian graphical models. A graphical model is a family of probability distributions in which the structure of interactions among the random variables is captured by a ...
  • Sontag, David Alexander (Massachusetts Institute of Technology, 2010)
    Graphical models such as Markov random fields have been successfully applied to a wide variety of fields, from computer vision and natural language processing, to computational biology. Exact probabilistic inference is ...
  • Yu, Huizhen, Ph. D. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2006)
    We consider approximation methods for discrete-time infinite-horizon partially observable Markov and semi-Markov decision processes (POMDP and POSMDP). One of the main contributions of this thesis is a lower cost approximation ...
  • Escobar Fernández de la Vega, Marcos (Massachusetts Institute of Technology, 1998)
  • Wang, Alexander C. (Alexander Che-Wei) (Massachusetts Institute of Technology, 2004)
    This thesis considers a discrete-time, finite-horizon dynamic portfolio problem where an investor makes sequential investment decisions with the goal of maximizing expected terminal wealth. We allow non-standard utility ...
  • Minkoff, Maria, 1976- (Massachusetts Institute of Technology, 2003)
    Combinatorial optimization problems arise in many fields of industry and technology, where they are frequently used in production planning, transportation, and communication network design. Whereas in the context of classical ...
  • Kleinberg, Jon M (Massachusetts Institute of Technology, 1996)
  • Lehman, Eric (Eric Allen), 1970- (Massachusetts Institute of Technology, 2002)
    This thesis considers the smallest grammar problem: find the smallest context-free grammar that generates exactly one given string. We show that this problem is intractable, and so our objective is to find approximation ...
  • Stein, Clifford (Massachusetts Institute of Technology, 1992)
  • Dean, Brian C. (Brian Christopher), 1975- (Massachusetts Institute of Technology, 2005)
    In this dissertation we study a broad class of stochastic scheduling problems characterized by the presence of hard deadline constraints. The input to such a problem is a set of jobs, each with an associated value, processing ...
  • Koile, Kimberle (Massachusetts Institute of Technology, 2001)
    In early stages of architectural design, as in other design domains, the language used is often very abstract. In architectural design, for example, architects and their clients use experiential terms such as "private" or ...
  • Ananian, C. Scott (Clifford Scott), 1976- (Massachusetts Institute of Technology, 2007)
    Transactions are gaining ground as a programmer-friendly means of expressing concurrency, as microarchitecture trends make it clear that parallel systems are in our future. This thesis presents the design and implementation ...
  • Saengudomlert, Poompat, 1973- (Massachusetts Institute of Technology, 2002)
    We study the routing and wavelength assignment (RWA) problem in wavelength division multiplexing (WDM) networks with no wavelength conversion. In a high-speed core network, the traffic can be separated into two components. ...
MIT-Mirage