๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Automatic Algorithm Selection for Complex Simulation Problems

โœ Scribed by Roland Ewald


Publisher
Vieweg+Teubner Verlag
Year
2011
Tongue
English
Leaves
387
Edition
2012
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 VOLUMES


Automatic Algorithm Selection for Comple
โœ Roland Ewald (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Vieweg+Teubner Verlag ๐ŸŒ English

<p><p>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 algorithm

Online Algorithms for the Portfolio Sele
โœ Robert Dochow (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2016 ๐Ÿ› Gabler Verlag ๐ŸŒ English

<p>Robert Dochow mathematically derives a simplified classification structure of selected types of the portfolio selection problem. He proposes two new competitive online algorithms with risk management, which he evaluates analytically. The author empirically evaluates online algorithms by a compreh

Programming for Problem-Solving with C:
โœ Dr. Kamaldeep ๐Ÿ“‚ Library ๐Ÿ“… 2024 ๐Ÿ› BPB Publications ๐ŸŒ English

Key Features โ— Comprehensive coverage of C programming fundamentals. โ— Clear explanations and engaging examples given in each chapter. โ— Designed to help you develop a problem-solving mindset. Description This book equips you with the knowledge of fundamentals of C, a powerful and versatile p

Genetic Algorithm for Solving Simple Mat
โœ Hermawanto D. ๐Ÿ“‚ Library ๐ŸŒ English

Paper, Indonesian Institute of Sciences (LIPI), Indonesia, 10 p.<br/>This paper explains genetic algorithm for novice in this field. Basic philosophy of genetic algorithm and its flowchart are described. Step by step numerical computation of genetic algorithm for solving simple mathematical equality