Zobrazeno 1 - 10
of 9 972
pro vyhledávání: '"Hoog, A."'
The densest subgraph problem is a classic problem in combinatorial optimisation. Danisch, Chan, and Sozio propose a definition for \emph{local density} that assigns to each vertex $v$ a value $\rho^*(v)$. This local density is a generalisation of the
Externí odkaz:
http://arxiv.org/abs/2411.12694
Accurate forecasts of distributed solar generation are necessary to reduce negative impacts resulting from the increased uptake of distributed solar photovoltaic (PV) systems. However, the high variability of solar generation over short time interval
Externí odkaz:
http://arxiv.org/abs/2411.10921
Autor:
Laporte, Silvy, Diviné, Marine, Girault, Danièle, Boutouyrie, Pierre, Chassany, Olivier, Cucherat, Michel, de Trogoff, Hervé, Dubois, Sophie, Fouret, Cecile, Hoog-Labouret, Natalie, Jolliet, Pascale, Mismetti, Patrick, Porcher, Raphaël, Rey-Coquais, Cécile, Vicaut, Eric
Publikováno v:
Therapies, 2016, 71 (1), pp.27-34
In a randomised clinical trial, when the result of the primary endpoint shows a significant benefit, the secondary endpoints are scrutinised to identify additional effects of the treatment. However, this approach entails a risk of concluding that the
Externí odkaz:
http://arxiv.org/abs/2409.14770
Fredman proposed in 1976 the following algorithmic problem: Given are a ground set $X$, some partial order $P$ over $X$, and some comparison oracle $O_L$ that specifies a linear order $L$ over $X$ that extends $P$. A query to $O_L$ has as input disti
Externí odkaz:
http://arxiv.org/abs/2407.21591
A classical problem in computational geometry and graph algorithms is: given a dynamic set S of geometric shapes in the plane, efficiently maintain the connectivity of the intersection graph of S. Previous papers studied the setting where, before the
Externí odkaz:
http://arxiv.org/abs/2406.20065
Autor:
van der Hoog, Ivor, Rutschmann, Daniel
Sorting has a natural generalization where the input consists of: (1) a ground set $X$ of size $n$, (2) a partial oracle $O_P$ specifying some fixed partial order $P$ on $X$ and (3) a linear oracle $O_L$ specifying a linear order $L$ that extends $P$
Externí odkaz:
http://arxiv.org/abs/2404.08468
Regional solar power forecasting, which involves predicting the total power generation from all rooftop photovoltaic systems in a region holds significant importance for various stakeholders in the energy sector. However, the vast amount of solar pow
Externí odkaz:
http://arxiv.org/abs/2403.01653
Imagine you are a dog behind a fence $Q$ and a hiker is passing by at constant speed along the hiking path $P$. In order to fulfil your duties as a watchdog, you desire to bark as long as possible at the human. However, your barks can only be heard i
Externí odkaz:
http://arxiv.org/abs/2402.13159
Given a trajectory $T$ and a distance $\Delta$, we wish to find a set $C$ of curves of complexity at most $\ell$, such that we can cover $T$ with subcurves that each are within Fr\'echet distance $\Delta$ to at least one curve in $C$. We call $C$ an
Externí odkaz:
http://arxiv.org/abs/2402.13117
Autor:
Chekuri, Chandra, Christiansen, Aleksander Bjørn, Holm, Jacob, van der Hoog, Ivor, Quanrud, Kent, Rotenberg, Eva, Schwiegelshohn, Chris
We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph, such that the out-degree of each vertex is bounded. On one hand, we show how to orient the edges such that the out-degree of each vertex is proportional to the ar
Externí odkaz:
http://arxiv.org/abs/2310.18146