Advanced Search
DSpace@MIT

Browsing MIT Open Access Articles by Title

Research and Teaching Output of the MIT Community

Browsing MIT Open Access Articles by Title

Sort by: Order: Results:

  • Levine, Lionel; Fey, Anne; Wilson, David B. (American Physical Society, 2010-09)
    A popular theory of self-organized criticality predicts that the stationary density of the Abelian sandpile model equals the threshold density of the corresponding fixed-energy sandpile. We recently announced that this ...
  • Ito, Takehiro; Demaine, Erik D. (Springer-Verlag, 2011-05)
    The subset sum problem is a well-known NP-complete problem in which we wish to find a packing (subset) of items (integers) into a knapsack with capacity so that the sum of the integers in the packing is at most the capacity ...
  • Indyk, Piotr; Venkatasubramanian, Suresh (Elsevier, 2003-02)
    The problem of geometric point set matching has been studied extensively in the domain of computational geometry, and has many applications in areas such as computer vision, computational chemistry, and pattern recognition. ...
  • Campbell, Trevor David; How, Jonathan P. (Association for Uncertainty in Artificial Intelligence Press, 2014-07)
    This paper presents an approximate method for performing Bayesian inference in models with conditional independence over a decentralized network of learning agents. The method first employs variational inference on each ...
  • Farias, Vivek F.; Saure, Denis; Weintraub, Gabriel Y. (Wiley Blackwell, 2012-06)
    In this article, we introduce a new method to approximate Markov perfect equilibrium in large-scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of ...
  • How, Jonathan P.; Bethke, Brett M. (Institute of Electrical and Electronics Engineers, 2009-07)
    This paper presents an approximate policy iteration algorithm for solving infinite-horizon, discounted Markov decision processes (MDPs) for which a model of the system is available. The algorithm is similar in spirit to ...
  • Bethke, Brett M.; How, Jonathan P. (Institute of Electrical and Electronics Engineers, 2009-07)
    This paper presents an approximate policy iteration algorithm for solving infinite-horizon, discounted Markov decision processes (MDPs) for which a model of the system is available. The algorithm is similar in spirit to ...
  • Bethke, Brett M.; How, Jonathan P. (Institute of Electrical and Electronics Engineers / American Automatic Control Council, 2010-06)
    This paper presents an modification to the method of Bellman Residual Elimination (BRE) for approximate dynamic programming. While prior work on BRE has focused on learning an approximate policy for an underlying Markov ...
  • Desai, Vijay V.; Farias, Vivek F.; Moallemi, Ciamac C. (Institute for Operations Research and the Management Sciences (INFORMS), 2012-05)
    We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural ...
  • Bertsekas, Dimitri P. (Springer-Verlag, 2011-08)
    We consider the classical policy iteration method of dynamic programming (DP), where approximations and simulation are used to deal with the curse of dimensionality. We survey a number of issues: convergence and rate of ...
  • Yunes, Nicolas; Gair, Jonathan (American Physical Society (APS), 2011-09)
    Extreme mass-ratio inspirals, in which a stellar-mass compact object spirals into a supermassive black hole, are prime candidates for detection with space-borne milliHertz gravitational wave detectors, similar to the Laser ...
  • Indyk, Piotr; Levi, Reut; Rubinfeld, Ronitt (Association for Computing Machinery (ACM), 2012-05)
    A discrete distribution p, over [n], is a k histogram if its probability distribution function can be represented as a piece-wise constant function with k pieces. Such a function is represented by a list of k intervals and ...
  • Goemans, Michel X.; Harvey, Nicholas J. A.; Iwata, Satoru; Mirrokni, Vahab (Society for Industrial and Applied Mathematics, 2009-01)
    Submodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle. Many interesting problems involving submodular ...
  • Ron, Dana; Rubinfeld, Ronitt; Safra, Muli; Weinstein, Omri (Springer Berlin / Heidelberg, 2011-08)
    The Total Influence (Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function f : {0, 1}[superscript n] → {0, ...
  • Halman, Nir; Simchi-Levi, David; Orlin, James B. (Institute for Operations Research and the Management Sciences (INFORMS), 2012-03)
    The single-item stochastic lot-sizing problem is to find an inventory replenishment policy in the presence of discrete stochastic demands under periodic review and finite time horizon. A closely related problem is the ...
  • Yedidia, Adam B.; Chertkov, Michael (Association for Computing Machinery (ACM), 2013-07)
    We discuss schemes for exact and approximate computations of permanents, and compare them with each other. Specifically, we analyze the belief propagation (BP) approach and its fractional belief propagation (FBP) generalization ...
  • Beigi, Salman; Shor, Peter W. (American Institute of Physics, 2010-04)
    The positive partial transpose test is one of the main criteria for detecting entanglement, and the set of states with positive partial transpose is considered as an approximation of the set of separable states. However, ...
  • Schulz, Andreas S.; Telha Cornejo, Claudio A. (Springer-Verlag, 2011-09)
    In the Joint Replenishment Problem (JRP), the goal is to coordinate the replenishments of a collection of goods over time so that continuous demands are satisfied with minimum overall ordering and holding costs. We consider ...
  • Moitra, Ankur (Institute of Electrical and Electronics Engineers, 2010-03)
    Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities) is O(logfe). Here we attempt to derive a more ...
  • Levi, Retsef; Shi, Cong (Institute for Operations Research and the Management Sciences (INFORMS), 2013-05)
    We develop new algorithmic approaches to compute provably near-optimal policies for multiperiod stochastic lot-sizing inventory models with positive lead times, general demand distributions, and dynamic forecast updates. ...
Open Access