Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Harder, Jonathan Gadea"'
This paper explores the enhancement of solution diversity in evolutionary algorithms (EAs) for the maximum matching problem, concentrating on complete bipartite graphs and paths. We adopt binary string encoding for matchings and use Hamming distance
Externí odkaz:
http://arxiv.org/abs/2404.11784
While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space $\mathbb{Z}^n$. This is a further generalization of the search space of multi-valued decision variables $\
Externí odkaz:
http://arxiv.org/abs/2307.11855
The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, agents select available resources and their utility then depends on the
Externí odkaz:
http://arxiv.org/abs/2305.00843
Autor:
Berger, Julian, Böther, Maximilian, Doskoč, Vanja, Harder, Jonathan Gadea, Klodt, Nicolas, Kötzing, Timo, Lötzsch, Winfried, Peters, Jannik, Schiller, Leon, Seifert, Lars, Wells, Armin, Wietheger, Simon
We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the languages to be learned. This abstracts a very universal learning task which c
Externí odkaz:
http://arxiv.org/abs/2010.09460
Autor:
Berger, Julian, Böther, Maximilian, Doskoč, Vanja, Harder, Jonathan Gadea, Klodt, Nicolas, Kötzing, Timo, Lötzsch, Winfried, Peters, Jannik, Schiller, Leon, Seifert, Lars, Wells, Armin, Wietheger, Simon
In language learning in the limit, the most common type of hypothesis is to give an enumerator for a language. This so-called $W$-index allows for naming arbitrary computably enumerable languages, with the drawback that even the membership problem is
Externí odkaz:
http://arxiv.org/abs/2011.09866