Zobrazeno 1 - 10
of 2 679
pro vyhledávání: '"A. Griesbach"'
Autor:
Griesbach, Sebastian, D'Eramo, Carlo
Exploration is a crucial and distinctive aspect of reinforcement learning (RL) that remains a fundamental open problem. Several methods have been proposed to tackle this challenge. Commonly used methods inject random noise directly into the actions,
Externí odkaz:
http://arxiv.org/abs/2410.23840
We consider an incremental variant of the rooted prize-collecting Steiner-tree problem with a growing budget constraint. While no incremental solution exists that simultaneously approximates the optimum for all budgets, we show that a bicriterial $(\
Externí odkaz:
http://arxiv.org/abs/2407.04447
In the impartial selection problem, a subset of agents up to a fixed size $k$ among a group of $n$ is to be chosen based on votes cast by the agents themselves. A selection mechanism is impartial if no agent can influence its own chance of being sele
Externí odkaz:
http://arxiv.org/abs/2310.14991
We study a novel approach to information design in the standard traffic model of network congestion games. It captures the natural condition that the demand is unknown to the users of the network. A principal (e.g., a mobility service) commits to a s
Externí odkaz:
http://arxiv.org/abs/2310.08314
We study the optimal provision of information for two natural performance measures of queuing systems: throughput and makespan. A set of parallel links is equipped with deterministic capacities and stochastic travel times where the latter depend on a
Externí odkaz:
http://arxiv.org/abs/2310.07656
Autor:
Griesbach, Tim, Burstedde, Carsten
We specify a file-oriented data format suitable for parallel, partition-independent disk I/O. Here, a partition refers to a disjoint and ordered distribution of the data elements between one or more processes. The format is designed such that the fil
Externí odkaz:
http://arxiv.org/abs/2307.06789
Model-based component-wise gradient boosting is a popular tool for data-driven variable selection. In order to improve its prediction and selection qualities even further, several modifications of the original algorithm have been developed, that main
Externí odkaz:
http://arxiv.org/abs/2302.13822
A searcher faces a graph with edge lengths and vertex weights, initially having explored only a given starting vertex. In each step, the searcher adds an edge to the solution that connects an unexplored vertex to an explored vertex. This requires an
Externí odkaz:
http://arxiv.org/abs/2301.03638
A clear understanding of the dynamic behavior of metals is critical for developing superior structural materials as well as for improving material processing techniques such as cold spray and shot peening. Using a high velocity (from 120 m/s to 700 m
Externí odkaz:
http://arxiv.org/abs/2210.14976
We consider a largely untapped potential for the improvement of traffic networks that is rooted in the inherent uncertainty of travel times. Travel times are subject to stochastic uncertainty resulting from various parameters such as weather conditio
Externí odkaz:
http://arxiv.org/abs/2205.09823