Tesis sobre el tema "Markov queueing model"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 18 mejores tesis para su investigación 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.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
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 completoGuan, Lin, Mike E. Woodward y Irfan U. Awan. "A discrete-time performance model for congestion control mechanism using queue thresholds with QOS constraints". 2005. http://hdl.handle.net/10454/473.
Texto completoRahul, R. "Low delay file transmissions over power constrained quasi-static fading channels". Thesis, 2022. https://etd.iisc.ac.in/handle/2005/5896.
Texto completoHemachandra, Nandyala. "Analysis And Optimization Of Queueing Models With Markov Modulated Poisson Input". Thesis, 1996. https://etd.iisc.ac.in/handle/2005/1676.
Texto completoHemachandra, Nandyala. "Analysis And Optimization Of Queueing Models With Markov Modulated Poisson Input". Thesis, 1996. http://etd.iisc.ernet.in/handle/2005/1676.
Texto completo"Generalized Pollaczek-Khinchin formula for queueing systems with Markov modulated services rates". 2013. http://library.cuhk.edu.hk/record=b5884418.
Texto completoThesis (Ph.D.)--Chinese University of Hong Kong, 2013.
Includes bibliographical references (leaves 109-116).
Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.
Abstract also in Chinese.
Zhang, Ruonan. "Cross-layer protocol design and performance study for wideband wireless networks". Thesis, 2009. http://hdl.handle.net/1828/2118.
Texto completoLin, Chuan. "Heavy traffic and Markov modulated models for wireless queueing systems and numerical methods for associated resource allocation problems". 2006. http://www.lib.ncsu.edu/theses/available/etd-12042006-061411/unrestricted/etd.pdf.
Texto completo(6629942), Anna N. Tatara. "Rate Estimators for Non-stationary Point Processes". Thesis, 2019.
Buscar texto completo