Zobrazeno 1 - 10
of 11 663
pro vyhledávání: '"A. Saglam"'
Super-TinyML aims to optimize machine learning models for deployment on ultra-low-power application domains such as wearable technologies and implants. Such domains also require conformality, flexibility, and non-toxicity which traditional silicon-ba
Externí odkaz:
http://arxiv.org/abs/2412.06542
Autor:
Saglam, Baturay, Kalogerias, Dionysis
Deterministic policy gradient algorithms are foundational for actor-critic methods in controlling continuous systems, yet they often encounter inaccuracies due to their dependence on the derivative of the critic's value estimates with respect to inpu
Externí odkaz:
http://arxiv.org/abs/2409.01477
Greene and Owens explore cubiquitous lattices as an obstruction to rational homology 3-spheres bounding rational homology 4-balls. The purpose of this article is to better understand which sublattices of $\mathbb{Z}^n$ are cubiquitous with the aim of
Externí odkaz:
http://arxiv.org/abs/2405.00500
Objective: Domestic abuse cases have risen significantly over the last four years, in part due to the COVID-19 pandemic and the challenges for victims and survivors in accessing support. In this study, we investigate the role that chatbots - Artifici
Externí odkaz:
http://arxiv.org/abs/2402.17393
Autor:
Saglam, Utku, Yavuz, Deniz
We present an analytical and numerical study of electromagnetic modes in micro and nano fibers (MNFs) where the electric and magnetic fields of the modes are not necessarily orthogonal to each other. We first investigate these modes for different fib
Externí odkaz:
http://arxiv.org/abs/2402.11042
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
We study the problem of deciding whether a given language is directed. A language $L$ is \emph{directed} if every pair of words in $L$ have a common (scattered) superword in $L$. Deciding directedness is a fundamental problem in connection with ideal
Externí odkaz:
http://arxiv.org/abs/2401.07106
Autor:
Afentaki, Florentia, Saglam, Gurol, Kokkinis, Argyris, Siozios, Kostas, Zervakis, Georgios, Tahoori, Mehdi B
Printed Electronics (PE) feature distinct and remarkable characteristics that make them a prominent technology for achieving true ubiquitous computing. This is particularly relevant in application domains that require conformal and ultra-low cost sol
Externí odkaz:
http://arxiv.org/abs/2312.17612
We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph $G=(V,E)$ and a set of fair moves $E_f\subseteq E$ a player is said to play "fair" in $G$ if th
Externí odkaz:
http://arxiv.org/abs/2310.13612
This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical system (CPS) design. Formally, we consider a game graph G, a temporal s
Externí odkaz:
http://arxiv.org/abs/2310.12767