by Abbinav Taneja., Thesis (S.M.)--Massachusetts Institute of Technology, Technology and Policy Program; and, (S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000., Includes bibliographical references (leaves 115-116).

by Sherry L. Buschmann., Thesis (S.M.M.O.T.)--Massachusetts Institute of Technology, Sloan School of Management, Management of Technology Program, 2001., Includes bibliographical references (leaves 113-116).

This paper presents a knowledge-based approach to facilitate the engineering design
process relating to spacecrafts. Because the design evolves over a long time and typically
involves individuals working at different locations and frequently for different
organizations, the degree of collaboration…

This paper presents the results of an ongoing effort to develop a direct solder bumping process for electronics packaging. The proposed process entails delivering molten droplets onto specific locations on electronic devices to form solder bumps. This study is focused…

by Gloria G. Moncayo., Thesis (M.B.A.)--Massachusetts Institute of Technology, Sloan School of Management, 1999., Includes bibliographical references (leaves 87-88).

Continued advances in the semiconductor industry will require the introduction of new materials and processes concurrent with shrinking device dimensions. These simultaneous demands drastically reduce margins for error and necessitate an increasingly quantitative understanding of semiconductor processes. Leaders of the…

by Daisuke Oka., Thesis (S.M.M.O.T.)--Massachusetts Institute of Technology, Sloan School of Management, Management of Technology Program, 2001., Includes bibliographical references (leaf 78).

In developing telephone-based conversational systems, we foresee future systems capable of supporting multiple domains and flexible vocabulary. Users can pursue several topics of interest within a single telephone call, and the system is able to switch transparently among domains within…

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other…

by Kah-Peng Aw., Thesis (M.B.A.)--Massachusetts Institute of Technology, Sloan School of Management, 2001., Includes bibliographical references (leaf 55).