Exchange Algorithm
The Exchange Algorithm is a Markov chain Monte Carlo method that belongs to the class of exact sampling algorithms and is distinguished by its use of an auxiliary variable and a proposal mechanism that enables exact sampling from target distributions with intractable normalizing constants by exchanging states between the current and proposed values.
190
Publications
9.1K
Citations
410
Authors
217
Institutions
Publications per year
2017–2026
45
Parents
190
ORTHOGONAL-MAXIMIN LATIN HYPERCUBE DESIGNS
V. Roshan Joseph, Ying Hung · 2008 · 267 citations
Opportunistic resource exchange in inter-vehicle ad-hoc networks
Bo Xu, Aris M. Ouksel, Ouri Wolfson · 2004 · 179 citations
1–5 of 190
410
6
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 410
217
University of Tabriz
Tabriz, Iran
10 h-index
21 publications
963 citations
University of Southampton
Southampton, United Kingdom
5 h-index
10 publications
3.2K citations
University of Southern California
Los Angeles, United States
5 h-index
5 publications
85 citations
Georgia Institute of Technology
Atlanta, United States
5 h-index
10 publications
972 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
11 publications
855 citations
Annamalai University
Chidambaram, India
4 h-index
8 publications
214 citations

Pennsylvania State University
State College, United States
4 h-index
6 publications
152 citations
Duke University
Durham, United States
4 h-index
12 publications
600 citations
1–8 of 217
10 publications · 803 citations
10
h-index
8 publications · 394 citations
8
h-index
5 publications · 261 citations
5
h-index
4 publications · 244 citations
4
h-index
4 publications · 165 citations
4
h-index
1–5