Browsing MIT Libraries by Title
Now showing items 3599-3618 of 61744
-
Approximate nearest neighbor problem in high dimensions
(Massachusetts Institute of Technology, 2005)We investigate the problem of finding the approximate nearest neighbor when the data set points are the substrings of a given text T. The exact version of this problem is defined as follows. Given a text T of length n, we ... -
Approximate nonlinear estimation.
(Massachusetts Institute of Technology, 1968) -
An approximate shortest path algorithm for hierarchical networks
(Massachusetts Institute of Technology, 1997) -
Approximate solution methods for partially observable Markov and semi-Markov decision processes
(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 ... -
Approximate solutions for multi-server queuing systems with Erlangian service times and an application to air traffic management
(Massachusetts Institute of Technology, 1998)This thesis is concerned with approximations of certain M(t)/G(t)/n(t)/n(t) + q queueing systems. More specifically, we are interested in such systems under very general conditions such as time-varying demand and capacity, ... -
Approximate solutions of the Poincaré problem,
(Massachusetts Institute of Technology, 1968) -
Approximate state estimation.
(Massachusetts Institute of Technology, 1969) -
Approximate string joins with abbreviations
(Massachusetts Institute of Technology, 2018)String joins have wide applications in data integration and cleaning. The inconsistency of data caused by data errors, term variations and missing values has led to the need for approximate string joins (ASJ). In this ... -
Approximate translation : media, narrative, and experience in urban design
(Massachusetts Institute of Technology, 2013)Approximate translation is developed as a design process through which the place-embedded history of an urban environment can be understood, allowing for better design and intervention in that urban environment. Generally, ... -
Approximate value iteration approaches to constrained dynamic portfolio problems
(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 ... -
Approximate, analytic performance models of integrated transit system components
(Massachusetts Institute of Technology, 1978) -
Approximating fluid schedules in packet-switched networks
(Massachusetts Institute of Technology, 2004)We consider a problem motivated by the desire to provide exible, rate-based, quality of service guarantees for packets sent over switches and switch networks. Our focus is solving a type of on-line, traffic scheduling ... -
Approximating the Log-Partition Function
(Massachusetts Institute of Technology, 2021-06)Graphical Models are used to represent structural information on a high-dimensional joint probability distribution. Their expressiveness offers simple reductions from a large number of NP-hard problems to inference tasks ... -
Approximating the maximum acyclic subgraph
(Massachusetts Institute of Technology, 2000) -
Approximating the noise sensitivity of a monotone Boolean function
(Massachusetts Institute of Technology, 2020)The noise sensitivity of a Boolean function ... is one of its fundamental properties. For noise parameter ..., the noise sensitivity is denoted as ... This quantity is defined as follows: First, pick ... uniformly at random ... -
Approximating the performance of a last mile transportation system
(Massachusetts Institute of Technology, 2012)The Last Mile Problem (LMP) refers to the provision of travel service from the nearest public transportation node to a home or office. We study the supply side of this problem in a stochastic setting, with batch demands ... -
Approximating the point binomial with the Gram-Charlier type B series
(Massachusetts Institute of Technology, 1960) -
Approximation algorithms for combinatorial optimization under uncertainty
(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 ... -
Approximation algorithms for disjoint paths problems
(Massachusetts Institute of Technology, 1996) -
Approximation algorithms for distributed and selfish agents
(Massachusetts Institute of Technology, 2005)Many real-world systems involve distributed and selfish agents who optimize their own objective function. In these systems, we need to design efficient mechanisms so that system-wide objective is optimized despite agents ...