Download Automatic Algorithm Selection for Complex Simulation by Roland Ewald PDF

By Roland Ewald

To choose the main compatible simulation set of rules for a given job is usually tricky. this is often because of difficult interactions among version beneficial properties, implementation information, and runtime atmosphere, which can strongly impact the final functionality. an automatic collection of simulation algorithms helps clients in establishing simulation experiments with no challenging professional wisdom on simulation.   Roland Ewald analyzes and discusses current techniques to unravel the set of rules choice challenge within the context of simulation. He introduces a framework for computerized simulation set of rules choice and describes its integration into the open-source modelling and simulation framework James II. Its choice mechanisms may be able to deal with 3 events: no earlier wisdom is on the market, the influence of challenge positive factors on simulator functionality is unknown, and a dating among challenge gains and set of rules functionality may be confirmed empirically. the writer concludes with an experimental overview of the constructed tools.

Show description

Read Online or Download Automatic Algorithm Selection for Complex Simulation Problems PDF

Best nonfiction_4 books

Exploring Language Structure: A Student's Guide

Designed for these commencing to learn linguistics, this can be a vigorous creation to 2 key elements of the constitution of language: syntax (the constitution of sentences) and morphology (the constitution of words). It exhibits scholars in a step by step style find out how to study the syntax and morphology of any language, by way of sincerely describing the fundamental equipment and methods, and offering virtually a hundred functional workouts according to info from a wealthy number of the world's languages.

Extra info for Automatic Algorithm Selection for Complex Simulation Problems

Example text

Using this approach for algorithm selection would mean to choose the algorithm with smallest best-, worst-, or average-case f (n) for a given input size n. Whether to consider memory or time consumption would depend on the user criteria. Additionally, one might derive some estimates of the constants c and c for each algorithm. , F = N ⊂ R1 ) for selecting the most suitable algorithm. The example illustrates how the greatest strengths of complexity theory — abstractness and generality — also lead to several problems in the ASP context: Firstly, two algorithms may have similar asymptotic behavior but still perform very different, depending on the problem at hand and their specific implementation [146].

4 ASP in a Simulation Context To make use of the theoretical framework described in this section, it is necessary to map it onto the actual problem to be solved here, which is the selection of algorithms for simulation. Hence, A is a set of simulation algorithms that take a model as input and compute the model’s behavior. The problem space P consists of all possible models that can be simulated with the algorithms from A — but this is not sufficient: as the algorithms can be executed on various computational resources that may strongly influence their performance, resource information is also relevant for algorithm selection and is therefore part of the problem space as well.

For example, such a sequence could be the set of polynomial functions with degree n = 1, 2, . . and therefore S1 ⊂ S2 ⊂ . . ⊂ S. The robustness of a selection mapping is a statistical concept that quantifies how much its performance deteriorates when it is applied to unusual selection problems, or when it has been constructed by considering those [121]. Rice illustrates this by comparing arithmetic mean and median, the latter being much more robust than the former when outliers are included [272, p.

Download PDF sample

Rated 4.30 of 5 – based on 12 votes