Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today’s fastest machines and simulators takes several weeks. A practical solution to the simulation problem is sampling. Sampled simulation selects a number of sampling units out of a complete program execution and only simulat...

Understanding the evolution of the Universe from the Big Bang to the current day is the fundamental goal of cosmology. A major part of this is the problem of structure formation: understanding the formation, growth and subsequent evolution of galaxies in the presence of Dark Matter. The world leading Galform group, based at the Institute of Computational Cosmology, Durham University, has develo...

the most important factor in donor-recipient matching for hematopoietic stem cell transplantation is their hla typing. for many patients, we can not find a full-matched donor. in high risk patients, one locus  mismatched related donors are suitable alternatives. (1, 2) since the matching of patients and their siblings usually is based on low resolution hla typing, the matching of one locus mism...

1 Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX 78712, USA 2 Chevron ETC, San Ramon, CA 94583, USA 3 ConocoPhillips, Houston, TX 77252, USA 4 Institute for Computational Engineering and Sciences, Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, Austin, TX 78712, USA 5 Department of Petroleum a...

History matching large reservoir models under a realistic geological continuity constraint remains an outstanding problem. We propose a new combined geostatistical and streamline-based method potentially capable of history matching large reservoir models, while accounting consistently for geological continuity as provided by a permeability histogram and variogram, and production data. While mos...

We consider the problem of repeatedly matching a set of alternatives to a set of agents with dynamic ordinal preferences. Despite a recent focus on designing one-shot matching mechanisms in the absence of monetary transfers, little study has been done on strategic behavior of agents in sequential assignment problems. We formulate a generic dynamic matching problem via a sequential stochastic ma...

A folk theorem for repeated matching games is established that holds if the stage game is not a pure coordination game. It holds independent of population size and for all matching rules—including rules that depend on players choices or the history of play. This paper also establishes an equilibrium condition and using this discovers two di¤erences between the equilibria of repeated matching ga...