1 citations · 1 across the 3 of their papers we have counts for
5 papers
Analysis of Evolutionary Diversity Optimisation for the Maximum Matching Problem
Jonathan Gadea Harder, Aneta Neumann, Frank Neumann
This paper explores the enhancement of solution diversity in evolutionary algorithms (EAs) for the maximum matching problem, concentrating on complete bipartite graphs and paths. W…
Run Time Bounds for Integer-Valued OneMax Functions
Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li +1
While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space . This is a further ge…
Strategic Resource Selection with Homophilic Agents
Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner +1
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, ag…
Learning Languages with Decidable Hypotheses
Julian Berger, Maximilian Böther, Vanja Doskoč +9
In language learning in the limit, the most common type of hypothesis is to give an enumerator for a language. This so-called -index allows for naming arbitrary computably enume…
Maps for Learning Indexable Classes
Julian Berger, Maximilian Böther, Vanja Doskoč +9
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 language…