Zobrazeno 1 - 10
of 2 363
pro vyhledávání: '"P. Kenter"'
Autor:
van Remmerden, Jesse, Kenter, Maurice, Roijers, Diederik M., Andriotis, Charalampos, Zhang, Yingqian, Bukhsh, Zaharah
In this paper, we introduce Multi-Objective Deep Centralized Multi-Agent Actor-Critic (MO- DCMAC), a multi-objective reinforcement learning (MORL) method for infrastructural maintenance optimization, an area traditionally dominated by single-objectiv
Externí odkaz:
http://arxiv.org/abs/2406.06184
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Meyer, Marius, Kenter, Tobias, Petrica, Lucian, O'Brien, Kenneth, Blott, Michaela, Plessl, Christian
Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone beca
Externí odkaz:
http://arxiv.org/abs/2403.18374
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Cameron, Thomas R., Hogben, Leslie, Kenter, Franklin H. J., Mojallal, Seyed Ahmad, Schuerger, Houston
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is introduced and hypergraph results on transversals and matchings are a
Externí odkaz:
http://arxiv.org/abs/2310.17904
We determine upper and lower bounds on the zero forcing number of 2-connected outerplanar graphs in terms of the structure of the weak dual. We show that the upper bound is always at most half the number of vertices of the graph. This work generalize
Externí odkaz:
http://arxiv.org/abs/2308.11517
Autor:
Van Hirtum, Lennart, De Causmaecker, Patrick, Goemaere, Jens, Kenter, Tobias, Riebler, Heinrich, Lass, Michael, Plessl, Christian
This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. T
Externí odkaz:
http://arxiv.org/abs/2304.03039
The computation of electron repulsion integrals (ERIs) over Gaussian-type orbitals (GTOs) is a challenging problem in quantum-mechanics-based atomistic simulations. In practical simulations, several trillions of ERIs may have to be computed for every
Externí odkaz:
http://arxiv.org/abs/2303.13632
Andreae (1986) proved that the cop number of connected $H$-minor-free graphs is bounded for every graph $H$. In particular, the cop number is at most $|E(H-h)|$ if $H-h$ contains no isolated vertex. The main result of this paper is an improvement on
Externí odkaz:
http://arxiv.org/abs/2302.14851
Autor:
Sam J. Buckton, Jasper O. Kenter, Nibedita Mukherjee, Sandra Waddock, Annela Anger-Kraavi, Simone Martino, Ioan Fazey, Adam P. Hejnowicz, Jane Kabubo-Mariara, Jordan O. Lafayette, Kristen Locy, Chris Scarr
Publikováno v:
Global Social Challenges Journal (2024)
‘New economics’ discourses – comprising diverse approaches advocated as more just and sustainable replacements of dominant neoclassical and neoliberal economic perspectives – have been criticised as insufficiently coherent to form the ‘disc
Externí odkaz:
https://doaj.org/article/2009ea32d2ef40d2b1704d7898b75a08
