Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities

Autor: van Hoesel, C. P. M., Wagelmans, A. P. M.

Publikováno v: Management Science, 1996 Jan 01. 42(1), 142-150.

Externí odkaz: https://www.jstor.org/stable/2633023

Graph neural networks for materials science and chemistry.

Autor: Reiser P; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; Institute of Nanotechnology, Karlsruhe Institute of Technology, Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany., Neubert M; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany., Eberhard A; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany., Torresi L; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany., Zhou C; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany., Shao C; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; Present Address: Institute for Applied Informatics and Formal Description Systems, Karlsruhe Institute of Technology, Kaiserstr. 89, 76133 Karlsruhe, Germany., Metni H; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; ECPM, Université de Strasbourg, 25 Rue Becquerel, 67087 Strasbourg, France., van Hoesel C; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; Department of Applied Physics, Eindhoven University of Technology, Groene Loper 19, 5612 AP Eindhoven, The Netherlands., Schopmans H; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; Institute of Nanotechnology, Karlsruhe Institute of Technology, Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany., Sommer T; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; Institute for Theory of Condensed Matter, Karlsruhe Institute of Technology, Wolfgang-Gaede-Str. 1, 76131 Karlsruhe, Germany.; Present Address: School of Chemistry, Trinity College Dublin, College Green, Dublin 2, Ireland., Friederich P; Institute of Theoretical Informatics, Karlsruhe Institute of Technology, Am Fasanengarten 5, 76131 Karlsruhe, Germany.; Institute of Nanotechnology, Karlsruhe Institute of Technology, Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen, Germany.

Publikováno v: Communications materials [Commun Mater] 2022; Vol. 3 (1), pp. 93. Date of Electronic Publication: 2022 Nov 26.

Sensitivity Analysis of List Scheduling Heuristics

Autor: Kolen, A.W. J., Rinnooy Kan, A. H. G., Van Hoesel, C. P. M., Wagelmans, Albert

When jobs have to be processed on a set of identical parallel machines so as to minimize the makespan of the schedule, list scheduling rules form a popular class of heuristics. The order in which jobs appear on the list is assumed here to be determin

Externí odkaz: http://hdl.handle.net/1721.1/5268

Efficient and Flexible Method for Reducing Moderate-Size Deep Neural Networks with Condensation.

Autor: Chen, Tianyi¹ (AUTHOR), Xu, Zhi-Qin John¹ (AUTHOR) xuzhiqin@sjtu.edu.cn

Publikováno v: Entropy. Jul2024, Vol. 26 Issue 7, p567. 27p.