Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Fried, Dror"'
Given a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs at every time step for every sequence of inputs, such that the LTL fo
Externí odkaz:
http://arxiv.org/abs/2401.11290
Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on them is deliberately traded for significant resource savings. Signific
Externí odkaz:
http://arxiv.org/abs/2305.18705
Autor:
Boneh-Shitrit, Tali, Amir, Shir, Bremhorst, Annika, Mills, Daniel S., Riemer, Stefanie, Fried, Dror, Zamansky, Anna
Similarly to humans, facial expressions in animals are closely linked with emotional states. However, in contrast to the human domain, automated recognition of emotional states from facial expressions in animals is underexplored, mainly due to diffic
Externí odkaz:
http://arxiv.org/abs/2206.05619
Devising a strategy to make a system mimicking behaviors from another system is a problem that naturally arises in many areas of Computer Science. In this work, we interpret this problem in the context of intelligent agents, from the perspective of L
Externí odkaz:
http://arxiv.org/abs/2205.09201
In the \emph{Adapter Design Pattern}, a programmer implements a \emph{Target} interface by constructing an \emph{Adapter} that accesses an existing \emph{Adaptee} code. In this work, we present a reactive synthesis interpretation to the adapter desig
Externí odkaz:
http://arxiv.org/abs/2105.13837
Discrete integration is a fundamental problem in computer science that concerns the computation of discrete sums over exponentially large sets. Despite intense interest from researchers for over three decades, the design of scalable techniques for co
Externí odkaz:
http://arxiv.org/abs/2010.10724
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (March 3, 2022) lmcs:5250
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple and natur
Externí odkaz:
http://arxiv.org/abs/1903.01368
Boolean functional synthesis is the process of constructing a Boolean function from a Boolean specification that relates input and output variables. Despite significant recent developments in synthesis algorithms, Boolean functional synthesis remains
Externí odkaz:
http://arxiv.org/abs/1808.08190
We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition to a form
Externí odkaz:
http://arxiv.org/abs/1805.07535
Autor:
Meel, Kuldeep S., Vardi, Moshe, Chakraborty, Supratik, Fremont, Daniel J., Seshia, Sanjit A., Fried, Dror, Ivrii, Alexander, Malik, Sharad
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification. While the theory of these problems was t
Externí odkaz:
http://arxiv.org/abs/1512.06633