Random Number and Variate Generation
暂无分享,去创建一个
[1] Fabrizio Dabbene,et al. A Randomized Cutting Plane Method with Probabilistic Geometric Convergence , 2010, SIAM J. Optim..
[2] John Lygeros,et al. Stochastic Optimization on Continuous Domains With Finite-Time Guarantees by Markov Chain Monte Carlo Methods , 2009, IEEE Transactions on Automatic Control.
[3] James C. Spall,et al. Introduction to Stochastic Search and Optimization. Estimation, Simulation, and Control (Spall, J.C. , 2007 .
[4] Santosh S. Vempala,et al. Simulated Annealing for Convex Optimization , 2004 .
[5] Joachim H. Ahrens,et al. Computer methods for sampling from gamma, beta, poisson and bionomial distributions , 1974, Computing.
[6] Santosh S. Vempala,et al. Solving convex programs by random walks , 2004, JACM.
[7] J. C. Spall. Feature - Estimation via markov chain monte carlo , 2003 .
[8] László Lovász,et al. Hit-and-run mixes fast , 1999, Math. Program..
[9] P. Hellekalek,et al. Random and Quasi-Random Point Sets , 1998 .
[10] P. Hellekalek. Good random number generators are (not so) easy to find , 1998 .
[11] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[12] J. Gentle. Random number generation and Monte Carlo methods , 1998 .
[13] Pierre L'Ecuyer,et al. Guest editors' introduction: special issue on uniform random number generation , 1998, TOMC.
[14] Takuji Nishimura,et al. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.
[15] Luc Devroye,et al. Random variate generation for multivariate unimodal densities , 1997, TOMC.
[16] Mihir Bellare,et al. "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case , 1997, CRYPTO.
[17] M. Simonovits,et al. Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .
[18] Mark Jerrum,et al. The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .
[19] R. Tweedie,et al. Rates of convergence of the Hastings and Metropolis algorithms , 1996 .
[20] Harald Niederreiter. New Developments in Uniform Pseudorandom Number and Vector Generation , 1995 .
[21] Pierre L'Ecuyer,et al. Uniform random number generation , 1994, Ann. Oper. Res..
[22] Pierre L'Ecuyer,et al. A search for good multiple recursive random number generators , 1993, TOMC.
[23] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[24] David Applegate,et al. Sampling and integration of near log-concave functions , 1991, STOC '91.
[25] Martin E. Dyer,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.
[26] Naomi S. Altman,et al. Bit-Wise Behavior of Random Number Generators , 1988 .
[27] Alan M. Frieze,et al. Reconstructing Truncated Integer Variables Satisfying Linear Congruences , 1988, SIAM J. Comput..
[28] Zoltán Füredi,et al. Computing the volume is difficult , 1986, STOC '86.
[29] Manuel Blum,et al. A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..
[30] L. Devroye. Non-Uniform Random Variate Generation , 1986 .
[31] Robert L. Smith,et al. Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..
[32] Reuven Y. Rubinstein,et al. Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.
[33] Donald E. Knuth,et al. The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .
[34] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .
[35] R. Tausworthe. Random Numbers Generated by Linear Recurrence Modulo Two , 1965 .
[36] Athanasios Papoulis,et al. Probability, Random Variables and Stochastic Processes , 1965 .
[37] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[38] T. W. Anderson,et al. Asymptotic Theory of Certain "Goodness of Fit" Criteria Based on Stochastic Processes , 1952 .