Literatura académica sobre el tema "Markov queueing model"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Markov queueing model".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Markov queueing model"
GAWRON, PIOTR, DARIUSZ KURZYK y ZBIGNIEW PUCHAŁA. "A MODEL FOR QUANTUM QUEUE". International Journal of Quantum Information 11, n.º 02 (marzo de 2013): 1350023. http://dx.doi.org/10.1142/s0219749913500238.
Texto completoTanackov, Prentkovskis, Jevtić, Stojić y Ercegovac. "A New Method for Markovian Adaptation of the Non-Markovian Queueing System Using the Hidden Markov Model". Algorithms 12, n.º 7 (28 de junio de 2019): 133. http://dx.doi.org/10.3390/a12070133.
Texto completoBöhm, W. y S. G. Mohanty. "Transient analysis of M/M/1 queues in discrete time by general server vacations". Journal of Applied Probability 31, A (1994): 115–29. http://dx.doi.org/10.2307/3214952.
Texto completoBöhm, W. y S. G. Mohanty. "Transient analysis of M/M/1 queues in discrete time by general server vacations". Journal of Applied Probability 31, A (1994): 115–29. http://dx.doi.org/10.1017/s0021900200107028.
Texto completoBalea, Paraschiv y Gheorghe Potcovaru. "A QUEUEING MODEL FOR SOME CATALYTIC REACTIONS". SOUTHERN BRAZILIAN JOURNAL OF CHEMISTRY 9, n.º 10 (20 de diciembre de 2001): 23–30. http://dx.doi.org/10.48141/sbjchem.v9.n10.2001.26_2001.pdf.
Texto completoTiến, Đỗ Văn y Csaba Rotter. "A CLOSED-FORM SOLUTION FOR A QUEUEING MODEL OF ENERGY EFFICIENT ETHERNET LINKS". Journal of Computer Science and Cybernetics 37, n.º 4 (12 de octubre de 2021): 453–64. http://dx.doi.org/10.15625/1813-9663/37/4/16126.
Texto completoBaek, Jung Woo, Ho Woo Lee, Se Won Lee y Soohan Ahn. "A Markov-modulated fluid flow queueing model under D -policy". Numerical Linear Algebra with Applications 18, n.º 6 (noviembre de 2011): 993–1010. http://dx.doi.org/10.1002/nla.811.
Texto completoVan Dijk, Nico M. "Perturbation theory for unbounded Markov reward processes with applications to queueing". Advances in Applied Probability 20, n.º 1 (marzo de 1988): 99–111. http://dx.doi.org/10.2307/1427272.
Texto completoVan Dijk, Nico M. "Perturbation theory for unbounded Markov reward processes with applications to queueing". Advances in Applied Probability 20, n.º 01 (marzo de 1988): 99–111. http://dx.doi.org/10.1017/s0001867800017961.
Texto completoBäuerle, Nicole y Ulrich Rieder. "Comparison Results for Markov-Modulated Recursive Models". Probability in the Engineering and Informational Sciences 11, n.º 2 (abril de 1997): 203–17. http://dx.doi.org/10.1017/s0269964800004769.
Texto completoTesis sobre el tema "Markov queueing model"
Rahme, Youssef. "Stochastic matching model on the general graphical structures". Thesis, Compiègne, 2021. http://www.theses.fr/2021COMP2604.
Texto completoMotivated by a wide range of assemble-to-order systems and systems of the collaborativeeconomy applications, we introduce a stochastic matching model on hypergraphs and multigraphs, extending the model introduced by Mairesse and Moyal 2016. In this thesis, the stochastic matching model on general graph structures are defined as follows: given a compatibility general graph structure S = (V; S) which of a set of nodes denoted by V that represent the classes of items and by a set of edges denoted by S that allows matching between different classes of items. Items arrive at the system at a random time, by a sequence (assumed to be i:i:d:) that consists of different classes of V; and request to be matched due to their compatibility according to S: The compatibility by groups of two or more (hypergraphical cases) and by groups of two with possibilities of matching between the items of the same classes (multigraphical cases). The unmatched items are stored in the system and wait for a future compatible item and as soon as they are matched they leave it together. Upon arrival, an item may find several possible matches, the items that leave the system depend on a matching policy _ to be specified. We study the stability of the stochastic matching model on hypergraphs, for different hypergraphical topologies. Then, the stability of the stochastic matching model on multigraphs using the maximal subgraph and minimal blow-up to distinguish the zone of stability
Rýzner, Zdeněk. "Využití teorie hromadné obsluhy při návrhu a optimalizaci paketových sítí". Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219285.
Texto completoMenéndez, Gómez José María. "Computational Methods for Control of Queueing Models in Bounded Domains". Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/28036.
Texto completoPh. D.
Gautam, S. Vijay. "Performance Analysis Of A Variation Of The Distributed Queueing Access Protocol". Thesis, Indian Institute of Science, 1995. https://etd.iisc.ac.in/handle/2005/149.
Texto completoGautam, S. Vijay. "Performance Analysis Of A Variation Of The Distributed Queueing Access Protocol". Thesis, Indian Institute of Science, 1995. http://hdl.handle.net/2005/149.
Texto completoHorký, Miroslav. "Modely hromadné obsluhy". Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-232033.
Texto completoLi, Xiaobai. "Stochastic models for MRI lesion count sequences from patients with relapsing remitting multiple sclerosis". Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1142907194.
Texto completoRamirez, Jose A. "Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models". University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282329260.
Texto completoTribastone, Mirco. "Scalable analysis of stochastic process algebra models". Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4629.
Texto completoMajedi, Mohammad. "A Queueing Model to Study Ambulance Offload Delays". Thesis, 2008. http://hdl.handle.net/10012/4019.
Texto completoLibros sobre el tema "Markov queueing model"
Percus, O. E. Queue length distributions in a Markov model of a multistage clocked queueing network. New York: Courant Institute of Mathematical Sciences, New York University, 1989.
Buscar texto completoMeyer, Carl D. y Robert J. Plemmons, eds. Linear Algebra, Markov Chains, and Queueing Models. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8351-2.
Texto completoD, Meyer C. y Plemmons Robert J, eds. Linear algebra, Markov chains, and queueing models. New York: Springer-Verlag, 1993.
Buscar texto completoMeyer, Carl D. y Robert J. Plemmons. Linear Algebra, Markov Chains, and Queueing Models. Springer, 2012.
Buscar texto completoCarl D. Meyer Robert J. Plemmons. Linear Algebra, Markov Chains, and Queueing Models. Springer, 2011.
Buscar texto completoCapítulos de libros sobre el tema "Markov queueing model"
Hong, S., H. G. Perros y H. Yamashita. "Approximate Analysis of a Discrete-Time Queueing Model of the Shared Buffer ATM Switch". En Linear Algebra, Markov Chains, and Queueing Models, 211–29. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8351-2_14.
Texto completoWalrand, Jean. "Networks—B". En Probability in Electrical Engineering and Computer Science, 93–113. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_6.
Texto completoMeena, Rakesh Kumar y Pankaj Kumar. "Performance Analysis of Markov Retrial Queueing Model under Admission Control F-Policy". En Mathematical Modeling and Computation of Real-Time Problems, 65–78. First edition. | Boca Raton : CRC Press, 2021.: CRC Press, 2020. http://dx.doi.org/10.1201/9781003055037-5.
Texto completoSharma, Reema, Navin Kumar y T. Srinivas. "Markov Chain Based Priority Queueing Model for Packet Scheduling and Bandwidth Allocation". En Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 91–103. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73423-1_9.
Texto completoKerobyan, K., R. Covington, R. Kerobyan y K. Enakoutsa. "An Infinite-Server Queueing $$MMAP_k|G_k|\infty $$ Model in Semi-Markov Random Environment Subject to Catastrophes". En Information Technologies and Mathematical Modelling. Queueing Theory and Applications, 195–212. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97595-5_16.
Texto completoKalashnikov, Vladimir V. "Markov Queueing Models". En Mathematical Methods in Queuing Theory, 261–95. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_9.
Texto completoBhat, U. Narayan. "Extended Markov Models". En An Introduction to Queueing Theory, 115–39. Boston: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4725-4_6.
Texto completoBhat, U. Narayan. "Imbedded Markov Chain Models". En An Introduction to Queueing Theory, 75–114. Boston: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4725-4_5.
Texto completoBhat, U. Narayan. "Imbedded Markov Chain Models". En An Introduction to Queueing Theory, 85–125. Boston, MA: Birkhäuser Boston, 2015. http://dx.doi.org/10.1007/978-0-8176-8421-1_5.
Texto completoKalashnikov, Vladimir V. "Discrete-Time Markov Queueing Models". En Mathematical Methods in Queuing Theory, 233–60. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_8.
Texto completoActas de conferencias sobre el tema "Markov queueing model"
Gangadhar, Nandyala D. y Govind R. Kadambi. "Complete Solution of a Markov Modulated Tandem Fluid Queueing Model of a Voice Network". En 2022 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT). IEEE, 2022. http://dx.doi.org/10.1109/conecct55679.2022.9865843.
Texto completoPeng-Yong Kong. "A Markov chain model for packet queueing delay analysis of a mobile user in HetNets". En 2015 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2015. http://dx.doi.org/10.1109/wcnc.2015.7127773.
Texto completoLiu, R. P., G. Sutton y I. B. Collings. "A 3-D Markov Chain Queueing Model of IEEE 802.11 DCF with Finite Buffer and Load". En ICC 2009 - 2009 IEEE International Conference on Communications. IEEE, 2009. http://dx.doi.org/10.1109/icc.2009.5198576.
Texto completoMorrison, James R. y P. R. Kumar. "Linear Programming Performance Bounds for Markov Chains With Polyhedrally Translation Invariant Probabilities and Applications to Unreliable Manufacturing Systems and Enhanced Wafer Fab Models". En ASME 2002 International Mechanical Engineering Congress and Exposition. ASMEDC, 2002. http://dx.doi.org/10.1115/imece2002-39274.
Texto completoBoutoumi, Bachira y Nawel Gharbi. "N-policy Priority Queueing Model for Energy and Delay Minimization in Wireless Sensor Networks Using Markov Chains". En 2023 International Conference on Advances in Electronics, Control and Communication Systems (ICAECCS). IEEE, 2023. http://dx.doi.org/10.1109/icaeccs56710.2023.10104978.
Texto completo