Approximation and Optimization of Compute-Intensive Environmental Simulations through Machine Learning Methods
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Karlsruhe, Karlsruher Institut für Technologie (KIT), Dissertation, 2024
- Schlagwort
-
Computersimulation
Simulation
Wissenschaftliches Rechnen
Evolutionsstrategie
Hochleistungsrechnen
Supercomputer
- Ereignis
-
Veröffentlichung
- (wo)
-
Karlsruhe
- (wer)
-
KIT-Bibliothek
- (wann)
-
2024
- Urheber
- Beteiligte Personen und Organisationen
-
Streit, Achim
Zehe, Erwin
- DOI
-
10.5445/IR/1000169007
- URN
-
urn:nbn:de:101:1-2024031303582799031649
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.0011, 16:58 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Azmi, Elnaz
- Streit, Achim
- Zehe, Erwin
- KIT-Bibliothek
Entstanden
- 2024
Ähnliche Objekte (12)
How to bring compute intensive C++ based apps to Android
Ferroelectric compute-in-memory annealer for combinatorial optimization problems
Quantum algorithms to compute the neighbour list of N-body simulations
Reproducible Workflows and Compute Environments for Reusable Datasets, Simulations and Research Software
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Compute-and-forward in multi-user relay networks : optimization, implementation, and secrecy
Compute-and-Forward in Multi-User Relay Networks : Optimization, Implementation, and Secrecy
Approximation algorithms for combinatorial optimization : proceedings
Think globally, compute locally
Compute-Service am RZ
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
How to bring compute intensive C++ based apps to Android
Ferroelectric compute-in-memory annealer for combinatorial optimization problems
Quantum algorithms to compute the neighbour list of N-body simulations
Reproducible Workflows and Compute Environments for Reusable Datasets, Simulations and Research Software
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Compute-and-forward in multi-user relay networks : optimization, implementation, and secrecy
Compute-and-Forward in Multi-User Relay Networks : Optimization, Implementation, and Secrecy
Approximation algorithms for combinatorial optimization : proceedings
Think globally, compute locally
Compute-Service am RZ
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
How to bring compute intensive C++ based apps to Android
Ferroelectric compute-in-memory annealer for combinatorial optimization problems
Quantum algorithms to compute the neighbour list of N-body simulations
Reproducible Workflows and Compute Environments for Reusable Datasets, Simulations and Research Software
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Compute-and-forward in multi-user relay networks : optimization, implementation, and secrecy
Compute-and-Forward in Multi-User Relay Networks : Optimization, Implementation, and Secrecy
Approximation algorithms for combinatorial optimization : proceedings
Think globally, compute locally
Compute-Service am RZ