.png){kind=icon}
返回
Random sampling: Billiard Walk algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2014.03.041.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. However in practice, the number of steps required to obtain uniformly distributed samples is rather high. We propose a new random walk algorithm based on billiard trajectories. Numerical experiments demonstrate much faster convergence to the uniform distribution. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Sampling
Monte-Carlo
Hit-and-Run
Billiards
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
A nomenclature for fungal PCR primers with examples from intron-containing SSU rDNA.png)
Mycologia
MycologiaIF0
PREAI
分享收藏
查看更多内容