Automatic Algorithm Selection for Complex Simulation Problems
Book information
Description
To select the most suitable simulation algorithm for a given task is often difficult. This is due to intricate interactions between model features, implementation details, and runtime environment, which may strongly affect the overall performance. An automated selection of simulation algorithms supports users in setting up simulation experiments without demanding expert knowledge on simulation. Roland Ewald analyzes and discusses existing approaches to solve the algorithm selection problem in the context of simulation. He introduces a framework for automatic simulation algorithm selection and describes its integration into the open-source modelling and simulation framework James II. Its selection mechanisms are able to cope with three situations: no prior knowledge is available, the impact of problem features on simulator performance is unknown, and a relationship between problem features and algorithm performance can be established empirically. The author concludes with an experimental evaluation of the developed methods.
Similar books
Computers and Intractability: A Guide to the Theory of NP-completeness
1979 · PDF
Computers and Intractability: A Guide to the Theory of NP-completeness
1979 · PDF
Understanding Network Hacks: Attack and Defense with Python 3, 2nd Edition
2021 · EPUB
Hands-on Signal Analysis with Python: An Introduction
2021 · PDF
Hands-on Signal Analysis with Python: An Introduction
2021 · EPUB
Python Challenges: 100 Proven Programming Tasks Designed to Prepare You for Anything
2022 · EPUB
Programming for Computations - Python: A Gentle Introduction to Numerical Simulations with Python 3.6, 2nd Edition
2019 · EPUB
Time Series Analysis in Climatology and Related Sciences
2021 · PDF