Now showing items 42421-42440 of 132365

    • Exact and approximate sampling by systematic stochastic search 

      Tenenbaum, Joshua B.; Jonas, Eric M.; Roy, Daniel; Mansinghka, Vikash K. (Journal of Machine Learning Research, 2009-04)
      We introduce _adaptive sequential rejection sampling_, an algorithm for generating exact samples from high-dimensional, discrete distributions, building on ideas from classical AI search. Just as systematic search algorithms ...
    • Exact and asymptotic enumeration of permutations with subsequence conditions 

      Bóna, Miklós (Massachusetts Institute of Technology, 1997)
    • Exact and heuristic approaches for a new circular layout problem 

      Hungerländer, Philipp; Maier, Kerstin; Pachatz, Veronika; Truden, Christian (Springer International Publishing, 2020-05-08)
      Abstract We discuss a new facility layout problem, the so-called Directed Circular Facility Layout Problem (DCFLP). The DCFLP aims to find an optimal arrangement of machines on a circular material handling ...
    • Exact and heuristic approaches for a new circular layout problem 

      Hungerländer, Philipp; Maier, Kerstin; Pachatz, Veronika; Truden, Christian (Springer International Publishing, 2020-05-08)
      Abstract We discuss a new facility layout problem, the so-called Directed Circular Facility Layout Problem (DCFLP). The DCFLP aims to find an optimal arrangement of machines on a circular material handling ...
    • Exact and Heuristic Methods for the Weapon Target Assignment Problem 

      Ahuja, Ravindra K.; Kumar, Arvind; Jha, Krishna; Orlin, James B. (2004-04-02)
      The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total ...
    • Exact and Heuristic Methods for the Weapon Target Assignment Problem 

      Ahuja, Ravindra; Kumar, Arvind; Jha, Krishna; Orlin, James (2004-12-10)
      The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so ...
    • Exact and stable recovery of sequences of signals with sparse increments via differential ℓ [subscript 1]-minimization 

      Ba, Demba E.; Babadi, Behtash; Purdon, Patrick; Brown, Emery N. (Neural Information Processing Systems Foundation, Inc., 2012-12)
      We consider the problem of recovering a sequence of vectors, (Xk)[K over k=0], for which the increments X[subscript k] - X[subscript k-1] are S[subscript k]-sparse (with S[subscript k] typically smaller than S[subscript ...
    • An exact approach for studying cargo transport by an ensemble of molecular motors 

      Materassi, Donatello; Roychowdhury, Subhrajit; Hays, Thomas; Salapaka, Murti (BioMed Central Ltd, 2013-11)
      Background: Intracellular transport is crucial for many cellular processes where a large fraction of the cargo is transferred by motor-proteins over a network of microtubules. Malfunctions in the transport mechanism ...
    • An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models 

      Chindelevitch, Leonid; Trigg, Jason; Regev, Aviv; Berger Leighton, Bonnie (Nature Publishing Group, 2014-10)
      Constraint-based models are currently the only methodology that allows the study of metabolism at the whole-genome scale. Flux balance analysis is commonly used to analyse constraint-based models. Curiously, the results ...
    • An exact combinatorial algorithm for minimum graph bisection 

      Delling, Daniel; Fleischman, Daniel; Goldberg, Andrew V.; Razenshteyn, Ilya; Werneck, Renato F. (Springer Berlin Heidelberg, 2014-09)
      We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equally-sized cells while minimizing the number of edges between them. Our algorithm is based on the ...
    • Exact computations in the statistical mechanics of disordered systems 

      Saul, Lawrence K. (Lawrence Kevin), 1969- (Massachusetts Institute of Technology, 1994)
    • Exact correlators of BPS Operators from the 3d superconformal bootstrap 

      Chester, Shai M.; Lee, Jaehoon; Pufu, Silviu S.; Yacoby, Ran (Springer-Verlag, 2015-03)
      We use the superconformal bootstrap to derive exact relations between OPE coefficients in three-dimensional superconformal field theories with N ≥ 4 supersymmetry. These relations follow from a consistent truncation of the ...
    • Exact decoding of phrase-based translation models through Lagrangian relaxation 

      Chang, Yin-Wen, S.M. Massachusetts Institute of Technology (Massachusetts Institute of Technology, 2012)
      This thesis describes two algorithms for exact decoding of phrase-based translation models, based on Lagrangian relaxation. Both methods recovers exact solutions, with certificates of optimality, on over 99% of test examples. ...
    • Exact dimension estimation of interacting qubit systems assisted by a single quantum probe 

      Sone, Akira; Cappellaro, Paola (American Physical Society, 2017-12)
      Estimating the dimension of an Hilbert space is an important component of quantum system identification. In quantum technologies, the dimension of a quantum system (or its corresponding accessible Hilbert space) is an ...
    • Exact Emergent Quantum State Designs from Quantum Chaotic Dynamics 

      Ho, Wen Wei; Choi, Soonwon (American Physical Society (APS), 2022-02-11)
      We present exact results on a novel kind of emergent random matrix universality that quantum many-body systems at infinite temperature can exhibit. Specifically, we consider an ensemble of pure states supported on a small ...
    • Exact Equivariance, Disentanglement and Invariance of Transformations 

      Liao, Qianli; Poggio, Tomaso (2017-12-31)
      Invariance, equivariance and disentanglement of transformations are important topics in the field of representation learning. Previous models like Variational Autoencoder [1] and Generative Adversarial Networks [2] attempted ...
    • Exact expressions for structure selection in cluster expansions 

      Mueller, Timothy K.; Ceder, Gerbrand (American Physical Society, 2010-08)
      The cluster expansion has proven to be a valuable tool in materials science to predict properties of configurationally ordered and disordered structures but the generation of cluster expansions can be computationally ...
    • An exact FCFS waiting-time analysis for a general class of G/G/s queueing systems 

      Bertsimas, Dimitris J.; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1987)
    • Exact First-Choice Product Line Optimization 

      Bertsimas, Dimitris J; Mišić, Velibor V. (Institute for Operations Research and the Management Sciences (INFORMS), 2019-05)
      A fundamental problem faced by firms is that of product line design: given a set of candidate products that may be offered to a collection of customers, what subset of those products should be offered to maximize the profit ...
    • Exact formulae for the fractional partition functions 

      Iskander, Jonas; Jain, Vanshika; Talvola, Victoria (Springer International Publishing, 2020-04-21)
      Abstract The partition function p(n) has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the “circle method” to estimate the size of p(n), ...