Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Cherifa, Maria"'
Inspired by sequential budgeted allocation problems, we study the online matching problem with budget refills. In this context, we consider an online bipartite graph G=(U,V,E), where the nodes in $V$ are discovered sequentially and nodes in $U$ are k
Externí odkaz:
http://arxiv.org/abs/2405.09920
We show we can control an epidemic reaction-diffusion on a directed, and heterogeneous, network by redirecting the flows, thanks to the optimisation of well-designed loss functions, in particular the basic reproduction number of the model. We provide
Externí odkaz:
http://arxiv.org/abs/2202.02017
We show we can control an epidemic reaction-diffusion on a directed, and heterogeneous, network by redirecting the flows, thanks to the optimisation of well-designed loss functions, in particular the basic reproduction number of the model. We provide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a1bdaca54a2541e2f4e583039f7c9c5
https://hal.archives-ouvertes.fr/hal-03554713/document
https://hal.archives-ouvertes.fr/hal-03554713/document