Zobrazeno 1 - 10
of 26 031
pro vyhledávání: '"Borgwardt, A."'
We study the problem of evacuation planning for natural disasters, focusing on wildfire evacuations. By creating pre-planned evacuation routes that can be updated based on real-time data, we provide an easily adjustable approach to fire evacuation pl
Externí odkaz:
http://arxiv.org/abs/2410.14500
Message-passing graph neural networks (GNNs) excel at capturing local relationships but struggle with long-range dependencies in graphs. In contrast, graph transformers (GTs) enable global information exchange but often oversimplify the graph structu
Externí odkaz:
http://arxiv.org/abs/2406.03386
Concrete domains have been introduced in the context of Description Logics to allow references to qualitative and quantitative values. In particular, the class of $\omega$-admissible concrete domains, which includes Allen's interval algebra, the regi
Externí odkaz:
http://arxiv.org/abs/2405.19096
Autor:
Bayer, Margaret M., Borgwardt, Steffen, Chambers, Teressa, Daugherty, Spencer, Dawkins, Aleyah, Deligeorgaki, Danai, Liao, Hsin-Chieh, McAllister, Tyrrell, Morrison, Angela, Nelson, Garrett, Vindas-Meléndez, Andrés R.
For $\mathbf{b}=(b_1,\dots,b_n)\in \mathbb{Z}_{>0}^n$, a $\mathbf{b}$-parking function is defined to be a sequence $(\beta_1,\dots,\beta_n)$ of positive integers whose nondecreasing rearrangement $\beta'_1\leq \beta'_2\leq \cdots \leq \beta'_n$ satis
Externí odkaz:
http://arxiv.org/abs/2403.07387
The circuits of a polyhedron are a superset of its edge directions. Circuit walks, a sequence of steps along circuits, generalize edge walks and are "short" if they have few steps or small total length. Both interpretations of short are relevant to t
Externí odkaz:
http://arxiv.org/abs/2402.01066
Understanding the relationships between protein sequence, structure and function is a long-standing biological challenge with manifold implications from drug design to our understanding of evolution. Recently, protein language models have emerged as
Externí odkaz:
http://arxiv.org/abs/2401.14819
Autor:
Borgwardt, Karl Heinz, Huhn, Petra
Publikováno v:
Mathematical Methods of Operations Research. 1999, Vol. 49 Issue 2, p175. 36p.
Autor:
Friedrichs-Manthey, Martin, Langhans, Simone D., Borgwardt, Florian, Hein, Thomas, Kling, Harald, Stanzel, Philipp, Jähnig, Sonja C., Domisch, Sami
Publikováno v:
Diversity and Distributions, 2024 Apr 01. 30(4), 1-14.
Externí odkaz:
https://www.jstor.org/stable/48764471
Autor:
Baker, KC
Publikováno v:
People.com; 12/12/2024, pN.PAG-N.PAG, 1p
Autor:
Borgwardt, Steffen, Morrison, Angela
There is a wealth of combinatorial algorithms for classical min-cost flow problems and their simpler variants like max flow or shortest path problems. It is well-known that many of these algorithms are related to the Simplex method and the more gener
Externí odkaz:
http://arxiv.org/abs/2312.12388