Zobrazeno 1 - 10
of 1 518
pro vyhledávání: '"Hertling A"'
Autor:
Hertling, Claus, Vujic, Matija
Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the existence of
Externí odkaz:
http://arxiv.org/abs/2412.17638
Autor:
Hertling, Claus, Vujic, Matija
The number of Nash equilibria of the mixed extension of a generic finite game in normal form is finite and odd. This raises the question how large the number can be, depending on the number of players and the numbers of their pure strategies. Here we
Externí odkaz:
http://arxiv.org/abs/2412.17890
Autor:
Hertling, Claus, Larabi, Khadija
This monograph starts with an upper triangular matrix with integer entries and 1's on the diagonal. It develops from this a spectrum of structures, which appear in different contexts, in algebraic geometry, representation theory and the theory of irr
Externí odkaz:
http://arxiv.org/abs/2412.16570
Ontology and knowledge graph matching systems are evaluated annually by the Ontology Alignment Evaluation Initiative (OAEI). More and more systems use machine learning-based approaches, including large language models. The training and validation dat
Externí odkaz:
http://arxiv.org/abs/2404.18542
Autor:
Hertling, Sven, Paulheim, Heiko
Ontology (and more generally: Knowledge Graph) Matching is a challenging task where information in natural language is one of the most important signals to process. With the rise of Large Language Models, it is possible to incorporate this knowledge
Externí odkaz:
http://arxiv.org/abs/2311.03837
In recent years, countless research papers have addressed the topics of knowledge graph creation, extension, or completion in order to create knowledge graphs that are larger, more correct, or more diverse. This research is typically motivated by the
Externí odkaz:
http://arxiv.org/abs/2308.10537
Autor:
Hertling, Peter, Janicki, Philip
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges computably to $0$
Externí odkaz:
http://arxiv.org/abs/2301.08124
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We also call a s
Externí odkaz:
http://arxiv.org/abs/2301.03285
Autor:
Hertling, Sven, Paulheim, Heiko
Large knowledge graphs like DBpedia and YAGO are always based on the same source, i.e., Wikipedia. But there are more wikis that contain information about long-tail entities such as wiki hosting platforms like Fandom. In this paper, we present the ap
Externí odkaz:
http://arxiv.org/abs/2210.02864
Autor:
Hertling, Sven, Paulheim, Heiko
The number of Knowledge Graphs (KGs) generated with automatic and manual approaches is constantly growing. For an integrated view and usage, an alignment between these KGs is necessary on the schema as well as instance level. While there are approach
Externí odkaz:
http://arxiv.org/abs/2209.07479