Zobrazeno 1 - 10
of 668
pro vyhledávání: '"Saffidine, A."'
Autor:
Mackenzie, Simon, Saffidine, Abdallah
In communication complexity the input of a function $f:X\times Y\rightarrow Z$ is distributed between two players Alice and Bob. If Alice knows only $x\in X$ and Bob only $y\in Y$, how much information must Alice and Bob share to be able to elicit th
Externí odkaz:
http://arxiv.org/abs/2411.19003
Autor:
Imene Miloudi
Publikováno v:
Multilinguales, Vol 17 (2022)
The problem treated in this article entitled "Heterolinguism and plurilistylismin :" Barkahoum’s White Dress "by Farida Saffidine,combines linguistics and literature, because it is essential to understand both the language of writing and the litera
Externí odkaz:
https://doaj.org/article/f7eedb98cc824cd8bf01791fe0fb6492
When designing a public transportation network in a country, one may want to minimise the sum of travel duration of all inhabitants. This corresponds to a purely utilitarian view and does not involve any fairness consideration, as the resulting netwo
Externí odkaz:
http://arxiv.org/abs/2409.02152
With the aim of improving performance in Markov Decision Problem in an Off-Policy setting, we suggest taking inspiration from what is done in Offline Reinforcement Learning (RL). In Offline RL, it is a common practice during policy learning to mainta
Externí odkaz:
http://arxiv.org/abs/2408.10113
Imperfect information games, such as Bridge and Skat, present challenges due to state-space explosion and hidden information, posing formidable obstacles for search algorithms. Determinization-based algorithms offer a resolution by sampling hidden in
Externí odkaz:
http://arxiv.org/abs/2408.02380
The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ chessboard so that no queen can capture any queen of the opposite color. In this
Externí odkaz:
http://arxiv.org/abs/2406.06974
Publikováno v:
2023 IEEE Conference on Games (CoG)
In imperfect information games (e.g. Bridge, Skat, Poker), one of the fundamental considerations is to infer the missing information while at the same time avoiding the disclosure of private information. Disregarding the issue of protecting private i
Externí odkaz:
http://arxiv.org/abs/2405.14346
Publikováno v:
International Conference on the Applications of Evolutionary Computation (Part of EvoStar), 2023, 753--764
In recent years, much progress has been made in computer Go and most of the results have been obtained thanks to search algorithms (Monte Carlo Tree Search) and Deep Reinforcement Learning (DRL). In this paper, we propose to use and analyze the lates
Externí odkaz:
http://arxiv.org/abs/2405.14265
Autor:
Martínez, Virginia Ardévol, Rizzi, Romeo, Saffidine, Abdallah, Sikora, Florian, Vialette, Stéphane
For any natural number $d$, a graph $G$ is a (disjoint) $d$-interval graph if it is the intersection graph of (disjoint) $d$-intervals, the union of $d$ (disjoint) intervals on the real line. Two important subclasses of $d$-interval graphs are unit a
Externí odkaz:
http://arxiv.org/abs/2404.17872
To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing better analysis methods for simple algorithms. In the mid-$2000$s, Fo
Externí odkaz:
http://arxiv.org/abs/2402.10015