The other Monte Carlo method

被引:1
|
作者
Beichl, I [1 ]
Sullivan, F
机构
[1] Natl Inst Stand & Technol, Informat Technol Lab, Gaithersburg, MD 20899 USA
[2] IDA Ctr Comp Sci, Bowie, MD USA
关键词
D O I
10.1109/MCSE.2006.35
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Although the Metropolis algorithm dates back to at least 1953, the fact that it could be used for approximate counting has become clear only in recent years. An algorithm specifically designed for counting was created around the some time as the Metropolis algorithm by some of the some researchers. This other Monte Carlo method, now known as sequential importance sampling (SIS), has proved to be very effective against a wide variety of problems.
引用
收藏
页码:42 / 47
页数:6
相关论文
共 50 条