Zobrazeno 1 - 10
of 22 419
pro vyhledávání: '"nondeterminism"'
Publikováno v:
Proc. ACM Program. Lang. 9, POPL, Article 19 (January 2025)
Programs increasingly rely on randomization in applications such as cryptography and machine learning. Analyzing randomized programs has been a fruitful research direction, but there is a gap when programs also exploit nondeterminism (for concurrency
Externí odkaz:
http://arxiv.org/abs/2410.22540
We introduce a version of probabilistic Kleene algebra with angelic nondeterminism and a corresponding class of automata. Our approach implements semantics via distributions over multisets in order to overcome theoretical barriers arising from the la
Externí odkaz:
http://arxiv.org/abs/2412.06754
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The increasing compute demands of AI systems have led to the emergence of services that train models on behalf of clients lacking necessary resources. However, ensuring correctness of training and guarding against potential training-time attacks, suc
Externí odkaz:
http://arxiv.org/abs/2403.09603
Publikováno v:
J. Log. Algebraic Methods Program. Vol. 92. 2017
We present a unified rule format for structural operational semantics with terms as labels that guarantees that the associated labelled transition system has some bounded-nondeterminism property. The properties we consider include finite branching, i
Externí odkaz:
http://arxiv.org/abs/2402.02847
Autor:
Aronson, Samuel J., Machini, Kalotina, Shin, Jiyeon, Sriraman, Pranav, Hamill, Sean, Henricks, Emma R., Mailly, Charlotte, Nottage, Angie J., Amr, Sami S., Oates, Michael, Lebo, Matthew S.
Background. Large Language Models (LLMs) hold promise for improving genetic variant literature review in clinical testing. We assessed Generative Pretrained Transformer 4's (GPT-4) performance, nondeterminism, and drift to inform its suitability for
Externí odkaz:
http://arxiv.org/abs/2312.13521
We consider imperative programs that involve both randomization and pure nondeterminism. The central question is how to find a strategy resolving the pure nondeterminism such that the so-obtained determinized program satisfies a given quantitative sp
Externí odkaz:
http://arxiv.org/abs/2311.06889
Autor:
Tang, Wenhao, Schrijvers, Tom
Some effects are considered to be higher-level than others. High-level effects provide expressive and succinct abstraction of programming concepts, while low-level effects allow more fine-grained control over program execution and resources. Yet, oft
Externí odkaz:
http://arxiv.org/abs/2312.02054
The purpose of this paper is to discuss the relevance of nondeterminism in computer science, with a special emphasis on Dijkstra's guarded commands language.
Comment: 34 pages. This is authors' version of Chapter 8 of the book K.R. Apt and C.A.R
Comment: 34 pages. This is authors' version of Chapter 8 of the book K.R. Apt and C.A.R
Externí odkaz:
http://arxiv.org/abs/2310.09004
We present the first optimal randomized algorithm for constructing the order-$k$ Voronoi diagram of $n$ points in two dimensions. The expected running time is $O(n\log n + nk)$, which improves the previous, two-decades-old result of Ramos (SoCG'99) b
Externí odkaz:
http://arxiv.org/abs/2310.15363