( en | de | ru )

 

Disambiguation of "Buchholz, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights.

, and . Comput. Oper. Res., (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter Buchholz

Peter Buchholz

Peter Buchholz

Peter Buchholz

Peter Buchholz

 

Other publications of authors with the same name

A multi-objective approach for PH-graphs with applications to stochastic shortest paths., and . Math. Methods Oper. Res., 93 (1): 153-178 (2021)Great-Nsolve: A Tool Integration for (Markov Regenerative) Stochastic Petri Nets., , and . QEST, volume 11785 of Lecture Notes in Computer Science, page 355-360. Springer, (2019)Stochastic Petri nets with matrix exponentially distributed firing times., and . Perform. Evaluation, 67 (12): 1373-1385 (2010)Concurrent MDPs with Finite Markovian Policies., and . MMB, volume 12040 of Lecture Notes in Computer Science, page 37-53. Springer, (2020)Parallelization of EM-Algorithms for Markovian Arrival Processes., , and . MMB, volume 12040 of Lecture Notes in Computer Science, page 173-189. Springer, (2020)The Numerical Analysis of Hierarchical Queueing Network Models.. MMB, volume 286 of Informatik-Fachberichte, page 30-45. Springer, (1991)SLA Tool., and . MMB, volume 10740 of Lecture Notes in Computer Science, page 302-306. Springer, (2018)Equivalence and Minimization for Model Checking Labeled Markov Chains., , and . VALUETOOLS, page 119-126. ACM, (2015)A component-level path-based simulation approach for efficient analysis of large Markov models., , and . WSC, page 584-590. IEEE Computer Society, (2005)An adaptive importance sampling approach for the transient analysis of markovian queueing networks.. Eur. Trans. Telecommun., 13 (4): 317-329 (2002)