Approximation and Optimization of Compute-Intensive Environmental Simulations through Machine Learning Methods
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Karlsruhe, Karlsruher Institut für Technologie (KIT), Dissertation, 2024
- Keyword
-
Computersimulation
Simulation
Wissenschaftliches Rechnen
Evolutionsstrategie
Hochleistungsrechnen
Supercomputer
- Event
-
Veröffentlichung
- (where)
-
Karlsruhe
- (who)
-
KIT-Bibliothek
- (when)
-
2024
- Creator
- Contributor
-
Streit, Achim
Zehe, Erwin
- DOI
-
10.5445/IR/1000169007
- URN
-
urn:nbn:de:101:1-2024031303582799031649
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Azmi, Elnaz
- Streit, Achim
- Zehe, Erwin
- KIT-Bibliothek
Time of origin
- 2024
Other Objects (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