Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Franziska Eberle"'
Autor:
Hannah B. Maier, Nicole Moschny, Franziska Eberle, Kirsten Jahn, Thorsten Folsche, Rasmus Schülke, Stefan Bleich, Helge Frieling, Alexandra Neyazi
Publikováno v:
Pharmacopsychiatry. 56:64-72
Introduction Precision medicine in psychiatry is still in its infancy. To establish patient-tailored treatment, adequate indicators predicting treatment response are required. Electroconvulsive therapy (ECT) is considered one of the most effective op
Autor:
HannahB Maier, Nicole Moschny, Franziska Eberle, Kirsten Jahn, Thorsten Folsche, Rasmus Schülke, Stefan Bleich, Helge Frieling, Alexandra Neyazi
Publikováno v:
Pharmacopsychiatry.
We investigate a semi-online variant of load balancing with restricted assignment. In this problem, we are given n jobs, which need to be processed by m machines with the goal to minimize the maximum machine load. Since strong lower bounds rule out a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2f3ed6f24add5cd794a16a345ab7eff
http://eprints.lse.ac.uk/114914/
http://eprints.lse.ac.uk/114914/
Autor:
Franziska Eberle
Publikováno v:
Operations Research Proceedings 2021 ISBN: 9783031086229
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9f0a102f27d3b47562ee9899cc7759d
https://doi.org/10.1007/978-3-031-08623-6_2
https://doi.org/10.1007/978-3-031-08623-6_2
Autor:
Dennis Haag, Sebastian Schmidt, Patrick Hufschmidt, Gisela Anton, Rafael Ballabriga, Rolf Behrens, Michael Campbell, Franziska Eberle, Christian Fuhg, Oliver Hupe, Xavier Llopart, Jurgen Roth, Lukas Tlustos, Winnie Wong, Hayo Zutz, Thilo Michel
First investigations regarding dosimetric properties of the hybrid, pixelated, photon-counting Dosepix detector in the direct beam of a pulsed photon field (RQR8) for the personal dose equivalent $H\mathrm{_p(10)}$ are presented. The influence quanti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1355c18bc50eccfa76b92b5effc7ac79
http://cds.cern.ch/record/2773259
http://cds.cern.ch/record/2773259
Publikováno v:
Operations Research Letters. 47:213-218
Minimizing the sum of completion times when scheduling jobs on m identical parallel machines is a fundamental scheduling problem. Unlike the well-understood deterministic variant, it is a major open problem how to handle stochastic processing times.
Autor:
Xavier Llopart, R. Behrens, Lukas Tlustos, H. Zutz, Christian Fuhg, P. Hufschmidt, Thilo Michel, Dennis Haag, Gisela Anton, Sebastian Schmidt, Michael Campbell, Rafael Ballabriga, O. Hupe, Jürgen Roth, W. Wong, Franziska Eberle
First measurements characterizing dosimetric properties of a dosimetry system designed for the purpose of active personal dosimetry for photons with mean energies from 12.4 to 1250 keV according to Physikalisch-Technische Bundesanstalt (PTB) requirem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e789848983a9ab9d0f55a4990e26daa
http://cds.cern.ch/record/2848075
http://cds.cern.ch/record/2848075
Autor:
Colin F. Davenport, Franziska Eberle, Helge Frieling, Kirsten Jahn, Lutz Wiehlmann, Marie Dorda, Stefan Bleich, Alexandra Neyazi, Hannah Benedictine Maier, Tristan Zindler, Nicole Moschny
Publikováno v:
Clinical Epigenetics
Background Major depressive disorder (MDD) represents a serious global health concern. The urge for efficient MDD treatment strategies is presently hindered by the incomplete knowledge of its underlying pathomechanism. Despite recent progress (highli
Publikováno v:
Mathematical programming, 197(2). Springer
The speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be grouped into at most m bags while the processing speeds of the machines are unknown. After the speeds are revealed, the grouped jobs must be assigned to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9665716297914c3c7a2e3288783542a
Publikováno v:
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019, May 2019, Ann Arbor, United States. pp.141-154, ⟨10.1007/978-3-030-17953-3_11⟩
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
Conference on Integer Programming and Combinatorial Optimization (IPCO) 2019, May 2019, Ann Arbor, United States. pp.141-154, ⟨10.1007/978-3-030-17953-3_11⟩
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
We study a fundamental online job admission problem where jobs with deadlines arrive online over time at their release dates, and the task is to determine a preemptive single-server schedule which maximizes the number of jobs that complete on time. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3ff65fc47352243d073383e8eb703f9
https://hal.science/hal-03989537
https://hal.science/hal-03989537