Zobrazeno 1 - 10
of 270 336
pro vyhledávání: '"A. Rabin"'
Autor:
Itamar Rabinovich
An insider's perspective on the life and influence of Israel's first native-born prime minister, his bold peace initiatives, and his tragic assassination More than two decades have passed since prime minister Yitzhak Rabin's assassination in 1995, ye
Markov Decision Processes (MDPs) model systems with uncertain transition dynamics. Multiple-environment MDPs (MEMDPs) extend MDPs. They intuitively reflect finite sets of MDPs that share the same state and action spaces but differ in the transition d
Externí odkaz:
http://arxiv.org/abs/2407.07006
Autor:
Peat, James T., Andersson, Erika
Oblivious transfer has been the interest of study as it can be used as a building block for multiparty computation. There are many forms of oblivious transfer; we explore a variant known as Rabin oblivious transfer. Here the sender Alice has one bit,
Externí odkaz:
http://arxiv.org/abs/2408.12388
Publikováno v:
Phys. Rev. Research 6, 043004 (2024)
Oblivious transfer between two untrusting parties is an important primitive in cryptography. There are different variants of oblivious transfer. In Rabin oblivious transfer, the sender Alice holds a bit, and the receiver Bob either obtains the bit, o
Externí odkaz:
http://arxiv.org/abs/2405.04486
We present a translation from linear temporal logic with past to deterministic Rabin automata. The translation is direct in the sense that it does not rely on intermediate non-deterministic automata, and asymptotically optimal, resulting in Rabin aut
Externí odkaz:
http://arxiv.org/abs/2405.01178
Autor:
Simoni, Marcella1 msimoni@unive.it
Publikováno v:
Israel Studies Review. Summer2023, Vol. 38 Issue 2, p67-85. 19p.
Autor:
Itamar Rabinovich
Die erste große Biographie über den Hoffnungsträger des Nahen Ostens. Bald ein Vierteljahrhundert liegt das Attentat auf dem Platz der Könige in Tel Aviv (heute Jitzchak-Rabin-Platz) zurück, das den Anfang vom Ende des hoffnungsvoll begonnenen F
We provide an algorithm to solve Rabin and Streett games over graphs with $n$ vertices, $m$ edges, and $k$ colours that runs in $\tilde{O}\left(mn(k!)^{1+o(1)} \right)$ time and $O(nk\log k \log n)$ space, where $\tilde{O}$ hides poly-logarithmic fac
Externí odkaz:
http://arxiv.org/abs/2401.07548
Autor:
Irma Handayani, Anita Fira Waluyo
Publikováno v:
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), Vol 18, Iss 4 (2024)
Kemajuan teknologi yang pesat telah mempermudah segala hal, termasuk dalam bidang pendidikan. Namun, kecanggihan tersebut juga mengakibatkan penyalahgunaan teknologi, terutama dalam hal duplikasi atau plagiarisme. Masalah ini tidak hanya terjadi pada
Externí odkaz:
https://doaj.org/article/48a20a7ab1d24f65aec80b6d9694b040
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.