DocumentCode :
2460415
Title :
Selecting Simulation Algorithm Portfolios by Genetic Algorithms
Author :
Ewald, Roland ; Schulz, René ; Uhrmacher, Adelinde M.
Author_Institution :
Inst. of Comput. Sci., Univ. of Rostock, Rostock, Germany
fYear :
2010
fDate :
17-19 May 2010
Firstpage :
1
Lastpage :
9
Abstract :
An algorithm portfolio is a set of algorithms that are bundled together for increased overall performance. While being mostly applied to computationally hard problems so far, we investigate portfolio selection for simulation algorithms and focus on their application to adaptive simulation replication. Since the portfolio selection problem is itself hard to solve, we introduce a genetic algorithm to select the most promising portfolios from large sets of simulation algorithms. The effectiveness of this mechanism is evaluated by data from both a realistic performance study and a dedicated test environment.
Keywords :
algorithm theory; genetic algorithms; adaptive simulation replication; genetic algorithm; portfolio selection problem; simulation algorithm portfolio; Application specific processors; Computational modeling; Computer science; Discrete event simulation; Feedback; Genetic algorithms; Hardware; Learning; Partitioning algorithms; Portfolios;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Principles of Advanced and Distributed Simulation (PADS), 2010 IEEE Workshop on
Conference_Location :
Atlanta
ISSN :
1087-4097
Print_ISBN :
978-1-4244-7292-5
Electronic_ISBN :
1087-4097
Type :
conf
DOI :
10.1109/PADS.2010.5471673
Filename :
5471673
Link To Document :
بازگشت