Optimization of Markov models with evolutionary strategies based on exact and approximate analysis techniques

Third International Conference on the Quantitative Evaluation of Systems, QEST 2006

Volumn , Issue , 2006, Pages 233-242

  Buchholz, Peter ^a   Kemper, Peter ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DECISION MAKING; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; SYSTEMS ANALYSIS;

COMPUTATIONALLY EXPENSIVE CALCULATION; EVOLUTIONARY STRATEGIES; MARKOV MODELS; QUEUEING SYSTEMS;

MARKOV PROCESSES;

EID: 41149140490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2006.39     Document Type: Conference Paper

References (16)

1. A. Bobbio and K. S. Trivedi. An aggregation technique for the transient analysis of stiff Markov chains. IEEE Trans. Computers, 35(9):803-814, 1986.
2. P. Buchholz. Adaptive decomposition and approximation for the analysis of stochastic Petri nets. Perform. Eval., 56(1-4):23-52, 2004.
3. P. Buchholz and T. Dayar. Comparison of multilevel methods for Kronecker-based Markovian representations. Computing, 73(4):349-371, 2004.
4. P. Buchholz and P. Kemper. Kronecker based matrix representations for large Markov models. In C. Baier et al, editor, Validation of Stochastic Systems, pages 256-295. LNCS 2925, Springer, 2004.
5. P. Buchholz and W. H. Sanders. Approximate computation of transient results for large Markov chains. In Franceschinis et al. [10], pages 126-135.
6. J. A. Carrasco. Computationally efficient and numerically stable reliability bounds for repairable fault-tolerant systems. IEEE Trans. Computers, 51(3):254-268, 2002.
7. David W. Coit and Alice E. Smith. Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach. Computers & OR, 23(6):515-526, 1996.
8. M. El-Beltagy, P. B. Nair, and A. J. Keane. Metamodeling techniques for evolutionary optimization of computationally expensive problems: Promises and limitations. In W. Banzhaf et al, editor, GECCO, pages 196-203. Morgan Kaufmann, 1999.
9. D. B: Fogel and Z. Michalewicz. How to solve it: Modern Heuristics. Springer, 2000.
10. G. Franceschinis, J.P. Katoen, and M. Woodside, editors. 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 27-30 September 2004, Enschede, The Netherlands. IEEE Computer Society, 2004.
11. Y. Jin. A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput., 9(1):3-12, 2005.
12. V. Lam, P. Buchholz, and W. H. Sanders. A structured pathbased approach for computing transient rewards of large CTMCs. In Franceschinis et al. [10], pages 136-145.
13. A. M. Law and W. D. Kelton. Simulation modeling and analysis. Wiley, 2000.
14. A. S. Miner, G. Ciardo, and S. Donatelli. Using the exact state space of a Markov model to compute approximate stationary measures. In SIGMETRICS, pages 207-216, 2000.
15. A. S. Miner and D. Parker. Symbolic representations and analysis of large probabilistic systems. In C. Baier et al, editor, Validation of Stochastic Systems, pages 296-338. LNCS 2925, Springer, 2004.
16. H. P. Schwefel. Evolution and Optimum Seeking. Wiley, 1995.