Overview
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (11 chapters)
-
Front Matter
-
Introduction
-
Background
-
Front Matter
-
-
Examples and Conclusion
-
Front Matter
-
-
Back Matter
Keywords
About this book
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.
Bibliographic Information
Book Title: Automatic Algorithm Selection for Complex Simulation Problems
Authors: Roland Ewald
DOI: https://doi.org/10.1007/978-3-8348-8151-9
Publisher: Vieweg+Teubner Verlag Wiesbaden
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 2012
Softcover ISBN: 978-3-8348-1542-2Published: 14 November 2011
eBook ISBN: 978-3-8348-8151-9Published: 20 November 2011
Edition Number: 1
Number of Pages: XXI, 382
Number of Illustrations: 81 b/w illustrations, 20 illustrations in colour
Topics: Computer Science, general
Industry Sectors: IT & Software, Telecommunications