Zobrazeno 1 - 10
of 1 927
pro vyhledávání: '"A, Sauerwald"'
Autor:
Sauerwald, Kai
We consider credibility-limited revision in the framework of belief change for epistemic spaces, permitting inconsistent belief sets and inconsistent beliefs. In this unrestricted setting, the class of credibility-limited revision operators does not
Externí odkaz:
http://arxiv.org/abs/2409.07119
Autor:
Sauerwald, Kai, Thimm, Matthias
This paper studies the realizability of belief revision and belief contraction operators in epistemic spaces. We observe that AGM revision and AGM contraction operators for epistemic spaces are only realizable in precisely determined epistemic spaces
Externí odkaz:
http://arxiv.org/abs/2407.20918
Autor:
Sauerwald, Kai, Kontinen, Juha
This paper considers KLM-style preferential non-monotonic reasoning in the setting of propositional team semantics. We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated by the no
Externí odkaz:
http://arxiv.org/abs/2405.06973
Autor:
Liebe, Lucas, Sauerwald, Franz, Sawicki, Sylwester, Schneider, Matthias, Schuhmann, Leo, Buz, Tolga, Boes, Paul, Ahmadov, Ahmad, de Melo, Gerard
Estimating the speed of vehicles using traffic cameras is a crucial task for traffic surveillance and management, enabling more optimal traffic flow, improved road safety, and lower environmental impact. Transportation-dependent systems, such as for
Externí odkaz:
http://arxiv.org/abs/2309.14468
Autor:
Los, Dimitrios, Sauerwald, Thomas
In the balanced allocations framework, there are $m$ jobs (balls) to be allocated to $n$ servers (bins). The goal is to minimize the gap, the difference between the maximum and the average load. Peres, Talwar and Wieder (RSA 2015) used the hyperbolic
Externí odkaz:
http://arxiv.org/abs/2308.11083
We introduce a new class of balanced allocation processes which bias towards underloaded bins (those with load below the mean load) either by skewing the probability by which a bin is chosen for an allocation (probability bias), or alternatively, by
Externí odkaz:
http://arxiv.org/abs/2308.05087
Autor:
LOS, DIMITRIOS1 dimitrios.los@cl.cam.ac.uk, SAUERWALD, THOMAS1 thomas.sauerwald@cl.cam.ac.uk
Publikováno v:
Journal of the ACM. Dec2023, Vol. 70 Issue 6, p1-84. 84p.
Autor:
Los, Dimitrios, Sauerwald, Thomas
Publikováno v:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2023)
In balanced allocations, the goal is to place $m$ balls into $n$ bins, so as to minimize the gap (difference of max to average load). The One-Choice process places each ball to a bin sampled independently and uniformly at random. The Two-Choice proce
Externí odkaz:
http://arxiv.org/abs/2302.04399
We consider the allocation of $m$ balls (jobs) into $n$ bins (servers). In the standard Two-Choice process, at each step $t=1,2,\ldots,m$ we first sample two bins uniformly at random and place a ball in the least loaded bin. It is well-known that for
Externí odkaz:
http://arxiv.org/abs/2301.09810
Autor:
Cohu, Amélie, Chevalier, Antoine, Nechyporuk, Oleksandr, Franzen, Andreas, Sauerwald, Jan, Ianigro, Jean-Christophe, Marteau, Jacques
The blast furnace (BF) is the fundamental tool used in the iron manufacture. Due to the difficulty of accessing direct measurements of the inner phenomena, we determined the density distribution of its internal volume in order to improve its producti
Externí odkaz:
http://arxiv.org/abs/2301.04354