I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
When to checkpoint at the end of a fixed-length reservation:
, In:
Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis
,
Barbut, Quentin
;
Benoit, Anne
;
Herault, Thomas
.. - p. 467-476 , 2023
Link:
https://dl.acm.org/doi/10.1145/3624062.3624115
RT T1 <cTitle>Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis</cTitle>: T1 <Title>When to checkpoint at the end of a fixed-length reservation?</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3624115&Exemplar=1&LAN=DE A1 Barbut, Quentin A1 Benoit, Anne A1 Herault, Thomas A1 Robert, Yves A1 Vivien, Frédéric PB ACM YR 2023 K1 Fixed-length reservation K1 checkpoint K1 iterative application K1 linear workflow K1 preemption K1 stochastic durations. K1 Mathematics of computing K1 Theory of computation K1 Software and its engineering K1 Design and analysis of algorithms K1 Theory and algorithms for application domains K1 Machine learning theory K1 Reinforcement learning K1 Sequential decision making SP 467 OP 476 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3624062.3624115 DO https://dl.acm.org/doi/10.1145/3624062.3624115 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
