000 02316nam a22003855i 4500
001 978-3-8348-8151-9
003 DE-He213
005 20140220083332.0
007 cr nn 008mamaa
008 111118s2012 gw | s |||| 0|eng d
020 _a9783834881519
_9978-3-8348-8151-9
024 7 _a10.1007/978-3-8348-8151-9
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM014000
_2bisacsh
082 0 4 _a004
_223
100 1 _aEwald, Roland.
_eauthor.
245 1 0 _aAutomatic Algorithm Selection for Complex Simulation Problems
_h[electronic resource] /
_cby Roland Ewald.
264 1 _aWiesbaden :
_bVieweg+Teubner Verlag,
_c2012.
300 _aXXI, 382p. 101 illus., 20 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
520 _aTo 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.
650 0 _aComputer science.
650 1 4 _aComputer Science.
650 2 4 _aComputer Science, general.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783834815422
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-8348-8151-9
912 _aZDB-2-SCS
999 _c103974
_d103974