Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Rau, Malin"'
We consider the Demand Strip Packing problem (DSP), in which we are given a set of jobs, each specified by a processing time and a demand. The task is to schedule all jobs such that they are finished before some deadline $D$ while minimizing the peak
Externí odkaz:
http://arxiv.org/abs/2408.08627
We settle the pseudo-polynomial complexity of the Demand Strip Packing (DSP) problem: Given a strip of fixed width and a set of items with widths and heights, the items must be placed inside the strip with the objective of minimizing the peak height.
Externí odkaz:
http://arxiv.org/abs/2404.15917
In the pooled data problem we are given $n$ agents with hidden state bits, either $0$ or $1$. The hidden states are unknown and can be seen as the underlying ground truth $\sigma$. To uncover that ground truth, we are given a querying method that que
Externí odkaz:
http://arxiv.org/abs/2303.00043
In this paper we study dynamic averaging load balancing on general graphs. We consider infinite time and dynamic processes, where in every step new load items are assigned to randomly chosen nodes. A matching is chosen, and the load is averaged over
Externí odkaz:
http://arxiv.org/abs/2302.12201
Consider the many shared resource scheduling problem where jobs have to be scheduled on identical parallel machines with the goal of minimizing the makespan. However, each job needs exactly one additional shared resource in order to be executed and h
Externí odkaz:
http://arxiv.org/abs/2210.01523
We consider the so-called Independent Cascade Model for rumor spreading or epidemic processes popularized by Kempe et al.\ [2003]. In this model, a small subset of nodes from a network are the source of a rumor. In discrete time steps, each informed
Externí odkaz:
http://arxiv.org/abs/2205.12125
Autor:
Berenbrink, Petra, Coja-Oghlan, Amin, Gebhard, Oliver, Hahn-Klimroth, Max, Kaaser, Dominik, Rau, Malin
We study the Consensus problem among $n$ agents, defined as follows. Initially, each agent holds one of two possible opinions. The goal is to reach a consensus configuration in which every agent shares the same opinion. To this end, agents randomly s
Externí odkaz:
http://arxiv.org/abs/2205.08203
Autor:
Berenbrink, Petra, Hoefer, Martin, Kaaser, Dominik, Lenzner, Pascal, Rau, Malin, Schmand, Daniel
Opinion spreading in a society decides the fate of elections, the success of products, and the impact of political or social movements. The model by Hegselmann and Krause is a well-known theoretical model to study such opinion formation processes in
Externí odkaz:
http://arxiv.org/abs/2201.12923
Autor:
Jansen, Klaus, Rau, Malin
In the problem called single resource constraint scheduling, we are given $m$ identical machines and a set of jobs, each needing one machine to be processed as well as a share of a limited renewable resource $R$. A schedule of these jobs is feasible
Externí odkaz:
http://arxiv.org/abs/2107.01613
We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we are given a set of jobs, specified by their processing times and energy requirements. The goal is to schedule all jobs within a fixed time period such that the peak load (the ma
Externí odkaz:
http://arxiv.org/abs/2105.07219