activity
20232025
most citedEfficient Parking Search using Shared Fleet Data

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

cs.LG2024

Dying Clusters Is All You Need -- Deep Clustering With an Unknown Number of Clusters

Collin Leiber, Niklas Strauß, Matthias Schubert +1

Finding meaningful groups, i.e., clusters, in high-dimensional data such as images or texts without labeled data at hand is an important challenge in data mining. In recent years,…

cs.AI2024

Autoregressive Policy Optimization for Constrained Allocation Tasks

David Winkel, Niklas Strauß, Maximilian Bernhard +3

Allocation tasks represent a class of problems where a limited amount of resources must be allocated to a set of entities at each time step. Prominent examples of this task include…

cs.AI2024★ 1 cited

Simplex Decomposition for Portfolio Allocation Constraints in Reinforcement Learning

David Winkel, Niklas Strauß, Matthias Schubert +1

Portfolio optimization tasks describe sequential decision problems in which the investor's wealth is distributed across a set of assets. Allocation constraints are used to enforce…

cs.AI2024★ 2 cited

Efficient Parking Search using Shared Fleet Data

Niklas Strauß, Lukas Rottkamp, Sebatian Schmoll +1

Finding an available on-street parking spot is a relevant problem of day-to-day life. In recent years, cities such as Melbourne and San Francisco deployed sensors that provide real…

cs.LG2024

Spatial-Aware Deep Reinforcement Learning for the Traveling Officer Problem

Niklas Strauß, Matthias Schubert

The traveling officer problem (TOP) is a challenging stochastic optimization task. In this problem, a parking officer is guided through a city equipped with parking sensors to fine…