Search results
Results: 345
Number of items: 345
-
Dębicki, K., & Mandjes, M. (2012). Lévy-driven queues. Surveys in Operations Research and Management Science, 17(1), 15-37. https://doi.org/10.1016/j.sorms.2011.08.001
-
Dębicki, K., Kosiński, K. M., & Mandjes, M. (2012). Gaussian queues in light and heavy traffic. Queueing Systems, 71(1-2), 137-149. https://doi.org/10.1007/s11134-011-9270-x
-
Mata, F., Zuraniewski, P., Mandjes, M., & Mellia, M. (2012). Anomaly detection in VoIP traffic with trends. In A. Jajszczyk, & Z. Papir (Eds.), 2012 24th International Teletraffic Congress (ITC 24): 4-7 September, Kraków, Poland: final program (pp. 9-16). IEEE. http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6324498
-
Koot, M. R., & Mandjes, M. R. H. (2012). The analysis of singletons in generalized birthday problems. Probability in the Engineering and Informational Sciences, 26(2), 245-262. https://doi.org/10.1017/S0269964811000350
-
Miretskiy, D. I., Scheinhardt, W. R. W., & Mandjes, M. R. H. (2012). On Efficiency of Multilevel Splitting. Communications in Statistics: Simulation and Computation, 41(6), 890-904. https://doi.org/10.1080/03610918.2012.625337
-
Hellings, T., Mandjes, M., & Blom, J. (2012). Semi-Markov-modulated infinite-server queues: approximations by time-scaling. Stochastic Models, 28(3), 452-477. https://doi.org/10.1080/15326349.2012.699759 -
Kemper, B., & Mandjes, M. (2012). Mean sojourn time in two-queue fork-join systems: bounds and approximations. OR Spectrum, 34(3), 723-742. https://doi.org/10.1007/s00291-010-0235-y
-
Mandjes, M., Palmowski, Z., & Rolski, T. (2012). Quasi-stationary workload in a Lévy-driven storage system. Stochastic Models, 28(3), 413-432. https://doi.org/10.1080/15326349.2012.699753
-
Dębicki, K., Kosiński, K. M., & Mandjes, M. (2012). On the infimum attained by a reflected Lévy process. Queueing Systems, 70(1), 23-35. https://doi.org/10.1007/s11134-011-9257-7
Page 22 of 35