Publisher
Springer Nature Switzerland
Reference28 articles.
1. Abbasi-Yadkori, Y., Bartlett, P., Gabillon, V., Malek, A.: Hit-and-run for sampling and planning in non-convex spaces. In: 20th International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 54, pp. 888–895 (2017)
2. Asmussen, S., Glynn, P.: A new proof of convergence of MCMC via the ergodic theorem. Stat. Probab. Lett. 81, 1482–1485 (2011)
3. Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469–483 (1996)
4. Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (2021)
5. Chalkis, A., Fisikopoulos, V.: Volesti: volume approximation and sampling for convex polytopes in R. R J. 13(2), 561 (2021)