This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Monte Carlo Minimization and Counting: One, Two, ..., Too Many
January/February 2007 (vol. 9 no. 1)
pp. 72-80
Dianne P. O'Leary, University of Maryland
Francis Sullivan, IDA Center for Computing Sciences
Monte Carlo methods use sampling to produce approximate solutions to problems for which other methods aren't practical. In this homework assignment, we study three uses of Monte Carlo methods: for function minimization, discrete optimization, and counting.
Index Terms:
Monte Carlo methods, sampling, minimization, computer science
Citation:
Isabel Beichl, Dianne P. O'Leary, Francis Sullivan, "Monte Carlo Minimization and Counting: One, Two, ..., Too Many," Computing in Science and Engineering, vol. 9, no. 1, pp. 72-80, Jan.-Feb. 2007, doi:10.1109/MCSE.2007.14
Usage of this product signifies your acceptance of the Terms of Use.