Pierre L'Ecuyer
BackCahiers du GERAD
105 results — page 1 of 6
Monte Carlo (MC) is widely used for the simulation of discrete time Markov chains. We consider the case of a \(d\)
-dimensional continuous state space and w...
Randomized Quasi-Monte Carlo (RQMC) methods provide unbiased estimators whose variance often converges at a faster rate than standard Monte Carlo as a functi...
BibTeX reference
We study a staffing optimization problem in multi-skill call centers. The objective is to minimize the total cost of agents under some quality of service (Q...
BibTeX reference
We consider the problem of estimating the density of a random variable \(X\)
which is the output of a simulation model.
We show how an unbiased density ...
We study quasi-Monte Carlo (QMC) integration of smooth functions defined over the multi-dimensional unit cube. Inspired by a recent work of Pan and Owen, we ...
BibTeX reference
We explore the use of Array-RQMC, a randomized quasi-Monte Carlo method designed for the simulation of Markov chains, to reduce the variance when simulating...
BibTeX referenceMultiple streams with recurrence-based, counter-based, and splittable random number generators
We give an overview of the state of the art on the design and implementation of random number generators for simulation and general Monte Carlo sampling in p...
BibTeX referenceLearning-based prediction of conditional wait time distributions in multiskill call centers
Based on data from real call centers, we develop, test, and compare forecasting methods to predict the waiting time of a call upon its arrival to the center,...
BibTeX reference
We study a solution approach for a staffing problem in multi-skill call centers. The objective is to find a minimal-cost staffing solution while meeting a ta...
BibTeX reference
We present LatNet Builder, a software tool to find good parameters for lattice rules, polynomial lattice rules, and digital nets in base 2, for quasi-Monte...
BibTeX reference
Estimating the unknown density from which a given independent sample originates is more difficult than estimating the mean, in the sense that for the best po...
BibTeX reference
Array-RQMC has been proposed as a way to effectively apply randomized quasi-Monte Carlo (RQMC) when simulating a Markov chain over a large number of steps to...
BibTeX reference
We extend a quasi-Monte Carlo scheme designed for coagulation to the simulation of the
coagulation-fragmentation equation. A number \(N\)
of particles is ...
We consider a two-stage stochastic discrete program in which some of the second stage constraints involve expectations that cannot be computed easily and a...
BibTeX reference
In emergency call centers (for police, firemen, ambulances, rescue teams) a single event can sometimes trigger many incoming calls to the center in a short p...
BibTeX reference
We study the behavior of a generalized splitting method for sampling from a given distribution conditional on the occurrence of a rare event. The method retu...
BibTeX reference
Random number generators were invented before there were symbols for writing numbers, and long before mechanical and electronic computers. All major civiliza...
BibTeX reference
We consider a network whose links have random capacities and in which a certain target amount of flow must be carried from some source nodes to some destina...
BibTeX reference
We study the behavior of a generalized splitting method for sampling from a given distribution conditional on the occurrence of a rare event. The method retu...
BibTeX reference
We survey basic ideas and results on randomized quasi-Monte Carlo (RQMC) methods, discuss their practical aspects, and give numerical illustrations. RQM...
BibTeX reference