Seguir
Fabian Zaiser
Título
Citado por
Citado por
Año
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem
S Hougardy, F Zaiser, X Zhong
Operations Research Letters 48 (4), 401-404, 2020
562020
Guaranteed bounds for posterior inference in universal probabilistic programming
R Beutner, CHL Ong, F Zaiser
Proceedings of the 43rd ACM SIGPLAN International Conference on Programming …, 2022
192022
Nonparametric hamiltonian monte carlo
C Mak, F Zaiser, L Ong
International Conference on Machine Learning, 7336-7347, 2021
122021
Exact Bayesian inference on discrete models via probability generating functions: a probabilistic programming approach
F Zaiser, A Murawski, CHL Ong
Advances in Neural Information Processing Systems 36, 2024
112024
Nonparametric involutive markov chain monte carlo
C Mak, F Zaiser, L Ong
International Conference on Machine Learning, 14802-14859, 2022
52022
The extended theory of trees and algebraic (co) datatypes
F Zaiser, CHL Ong
arXiv preprint arXiv:2005.06659, 2020
32020
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
F Zaiser, AS Murawski, CHL Ong
Proceedings of the ACM on Programming Languages 9 (POPL), 1104-1135, 2025
12025
Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds
F Zaiser
University of Oxford, 2024
12024
The 2-opt Heuristic for the Euclidean TSP on Grid Graphs
F Zaiser
Rheinische Friedrich-Wilhelms-Universität Bonn, 2018
2018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–9