Bibliografie tematiche / Queuing theory

Indice

Articoli di riviste
Tesi
Libri
Capitoli di libri
Atti di convegni
Rapporti di organizzazioni

Letteratura scientifica selezionata sul tema "Queuing theory"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 1 agosto 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Queuing theory".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Queuing theory"

Wang, Yulu. "Research on the Queuing Theory based on M/M/1 Queuing Model". Highlights in Science, Engineering and Technology 61 (30 luglio 2023): 80–87. http://dx.doi.org/10.54097/hset.v61i.10276.

Testo completo

Abstract (sommario):

A collection of mathematical theories and models make up queueing theory. The theory, which is derived from several models, makes an effort to recreate numerous typical queue waiting models. The purpose of this study is to do research on the M/M/1 queuing model-based queueing theory. After a brief introduction to the queuing theory, the independent indexes and the dependent variables will be shown. This paper contains some fundamental queuing theory formulas, some of which are specifically derived for the M/M/1 queuing model. This study then presents a simulation of the M/M/1 queuing model. Since some results are attained, this paper revealed some probability distributions and distribution functions of several indexes. The data characteristics displayed by these figures are very consistent with the daily life situation, which also proved the rationality and M/M/1 queuing model's applicability. By investigating this queuing theory, people shall be able to understand, analyze, and predict the phenomenon of waiting in a line.

Gli stili APA, Harvard, Vancouver, ISO e altri

Borodin, Allan, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan e David P. Williamson. "Adversarial queuing theory". Journal of the ACM 48, n. 1 (gennaio 2001): 13–38. http://dx.doi.org/10.1145/363647.363659.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

A.Sridhar, H. Saddam Hussain,. "Economical Situation of the M/M/1/κ Markovian Queueing system with Encouraged Incoming and maintained of Reneged Customers". Tuijin Jishu/Journal of Propulsion Technology 44, n. 4 (16 ottobre 2023): 6042–48. http://dx.doi.org/10.52783/tjjpt.v44.i4.2036.

Testo completo

Abstract (sommario):

Today’s businesses all strive to operate smoothly and efficiently in order to meet customer demandand provide the best possible service because of the intense competition. The queuing theory is crucial in this situation. Queueing models can assist businesses in understanding their performance in advance, enabling themto plan effectively for providing seamless and effective customer service as well as long-term sustainability. Businesses entice customers to sign up for the system by offering promotions and discounts. Customers wait even longer in queue to receive services as a result of incentives like discounts.An analysis is conducted on a finite Markovian single-server queuing model with encouraged arrivals, reneging, and retention of reneged customers. Iterative derivation is used to reach the model's steady state solution. Additionally, the queueing model's performance metrics are gathered. As unique example of this model,several significant queuing models are derived. In order to develop a cost model, a model's economic analysis is presented, and a discussion of numerical representation is also included.Customers are added when they are welcomed, which changes the way theybehave in a queueing system.

Gli stili APA, Harvard, Vancouver, ISO e altri

P, Divya. "Queuing Theory in Traffic Management System". International Journal for Research in Applied Science and Engineering Technology 9, n. 12 (31 dicembre 2021): 233–38. http://dx.doi.org/10.22214/ijraset.2021.39081.

Testo completo

Abstract (sommario):

Abstract: In cities where the number of vehicles has consistently expanded faster than the transportation infrastructure available to serve them. More on queuing theory and its crucial application has been discussed in the current study. In Thudiyalur, Gandhipuram, and Periyanaickenpalayam, all in Coimbatore, this research examines the usefulness of queuing theory in the field of traffic management. The concept of traffic intensity isapplied to a set of areas in queuing theory in this study. Keywords: Traffic intensity, Queuing theory, Single server Poisson model

Gli stili APA, Harvard, Vancouver, ISO e altri

Min, Xu Guang, Tao Wan, Jun Fang e Shan Liu. "Design of TVM Based on Parallel Virtual Queuing Theory". Advanced Materials Research 1030-1032 (settembre 2014): 2195–98. http://dx.doi.org/10.4028/www.scientific.net/amr.1030-1032.2195.

Testo completo

Abstract (sommario):

From what has been discussed above, the design of parallel virtual queuing, means that the passenger chooses the trains, the time, departures and terminals, seat types on TVM by blackening a ticket purchasing card. All the job off the TVM can be done by all the passengers all at once, which is equal to every passenger is being served at the counter (TVM), and thus the queuing time are greatly reduced in peak hours. Therefore, the queuing is equal to “Parallel Virtual Queuing”, and the equivalent queuing model is M/M/∞/∞/∞/FCFS.

Gli stili APA, Harvard, Vancouver, ISO e altri

Ma, Fan-Qi, e Rui-Na Fan. "Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus". Mathematics 10, n. 2 (7 gennaio 2022): 182. http://dx.doi.org/10.3390/math10020182.

Testo completo

Abstract (sommario):

In recent years, the use of consensus mechanism to maintain the security of blockchain system has become a considerable concern of the community. Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. First, this study proposes a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated from steady-state conditions and key performance measure of the system. Third, the current study uses the theoretical method of open (Jackson) queuing network, combined with the blockchain consensus process, and provides theoretical analysis with special cases. Lastly, this research utilizes numerical examples to verify the computability of the theoretical results. The analytic method is expected to open a series of potentially promising research in queueing theory of blockchain systems.

Gli stili APA, Harvard, Vancouver, ISO e altri

Hess, Svjetlana, e Ana Grbčić. "The Multiphase Queuing System of the Rijeka Airport". Pomorstvo 33, n. 2 (19 dicembre 2019): 205–9. http://dx.doi.org/10.31217/p.33.2.10.

Testo completo

Abstract (sommario):

The paper gives an overview of the real system as a multiphase single server queuing problem, which is a rare case in papers dealing with the application of the queueing theory. The methodological and scientific contribution of this paper is primarily in setting up the model of the real problem applying the multiphase queueing theory. The research of service system at Rijeka Airport may allow the airport to be more competitive by increasing service quality. The existing performance measures have been evaluated in order to improve Rijeka Airport queueing system, as a record number of passengers is to be expected in the next few years. Performance indicators have pointed out how the system handles congestion. The research is also focused on defining potential bottlenecks and comparing the results with IATA guidelines in terms of maximum waiting times.

Gli stili APA, Harvard, Vancouver, ISO e altri

Nosek, Ronald Anthony, e James P. Wilson. "Queuing Theory and Customer Satisfaction: A Review of Terminology, Trends, and Applications to Pharmacy Practice". Hospital Pharmacy 36, n. 3 (marzo 2001): 275–79. http://dx.doi.org/10.1177/001857870103600307.

Testo completo

Abstract (sommario):

Queuing theory is the formal study of waiting in line and is an entire discipline in operations management. This article will give the reader a general background into queuing theory, its associated terminology, and it relationship to customer satisfaction. Queuing theory has been used in the past to assess such things as staff schedules, working environment, productivity, customer waiting time, and customer waiting environment. In pharmacy, queuing theory can be used to assess a multitude of factors such as prescription fill-time, patient waiting time, patient counseling-time, and staffing levels. The application of queuing theory may be of particular benefit in pharmacies with high-volume outpatient workloads and/or those that provide multiple points of service. By better understanding queuing theory, service managers can make decisions that increase the satisfaction of all relevant groups – customers, employees, and management.

Gli stili APA, Harvard, Vancouver, ISO e altri

Večeřa, Filip, e Lukáš Pavlík. "The finding of the queuing theory models for evaluation throughput of the IRS radio network in the Czech Republic". MATEC Web of Conferences 292 (2019): 02006. http://dx.doi.org/10.1051/matecconf/201929202006.

Testo completo

Abstract (sommario):

The queuing theory is a discipline that uses mathematical procedures to evaluate the usability of the utilization system - a radio-communication network. The paper describes the basic parameters of queuing systems and explains the individual variables used in queuing theory models. The functional principles of individual queuing theory models are graphically depicted in the article. The article also includes basic knowledge of the functions of the PEGAS radio communication network, which is used by IRS in the Czech Republic. Not least, the article searches for the most convenient model of queuing theory for the possible evaluation of the transmissivity of the Czech IRS radio network.

Gli stili APA, Harvard, Vancouver, ISO e altri

Li, Guoshuai. "Markov chain and queuing theory in nucleic acid tests". Theoretical and Natural Science 19, n. 1 (8 dicembre 2023): 6–11. http://dx.doi.org/10.54254/2753-8818/19/20230474.

Testo completo

Abstract (sommario):

This article mainly introduces M/M/1 queue and M/M/S queue applied in nucleic acid tests which are applications of Markov chains in queuing theory. Firstly, it is pointed that in the two kinds of queuing models, the arrival time and the service time have no aftereffect which means the two kinds of time both belong to the Markov chain, and it is also illustrated that the arrival time and the service time obey the Poisson distribution, which reflects the uniqueness and stability of the two types of queuing models. The distribution functions of waiting time, service time queue length and so on could be obtained by solving the models. Therefore, by comparing the advantages and disadvantages of different models, the managers could make better decisions which are helpful to allocate resources reasonably, avoid overcrowding and decrease the risk of virus transmission. Furthermore, some other queuing models which are in the more special cases and the innovations of many queuing models are also presented briefly. In the end, the applications of such queuing models in other fields are shown.

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Queuing theory"

Wu, Kan. "New results in factory physics". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/31650.

Testo completo

Abstract (sommario):

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Leon McGinnis; Committee Co-Chair: Bert Zwart; Committee Member: Antonius Dieker; Committee Member: Craig Tovey; Committee Member: Hayriye Ayhan; Committee Member: Mark Ferguson. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Gli stili APA, Harvard, Vancouver, ISO e altri

Leontas, Angela Zoi. "Modeling queueing systems". CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3101.

Testo completo

Abstract (sommario):

The thesis introduces the theory of queueing systems and demonstrates its applicability to real life problems. It discusses (1) Markovian property and measures of effectiveness with exponential interarrival and service times; (2) Erlang service times, and a single server; (3) different goodness-of-fit tests that can be used to determine whether the exponential distribution is appropriate for a given set of data. A single server queueing system with exponential interarrival times and Erlang service times is simulated using Visual Basic for Applications (VBA).

Gli stili APA, Harvard, Vancouver, ISO e altri

Coyle, Andrew James. "Some problems in queueing theory". Title page, contents and summary only, 1989. http://web4.library.adelaide.edu.au/theses/09PH/09phc8812.pdf.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rumsewicz, Michael P. "Some contributions to the fields of insensitivity and queueing theory". Title page, contents and summary only, 1988. http://web4.library.adelaide.edu.au/theses/09PH/09phr938.pdf.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kumaran, Jayesh Liefvoort Appie van de. "Approximation models and approaches for computing performance measures that arise in single server queueing systems". Diss., UMK access, 2006.

Cerca il testo completo

Abstract (sommario):

Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006.
"A dissertation in telecommunications networking and computer networking." Advisor: Appie van de Liefvoort. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Jan. 29, 2007. Includes bibliographical references (leaves 108-116). Online version of the print edition.

Gli stili APA, Harvard, Vancouver, ISO e altri

Sabo, David Warren. "Closure methods for the single-server retrial queue". Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26528.

Testo completo

Abstract (sommario):

This work focuses on the development and evaluation of so-called "closure methods" for solving the equations governing the time-dependent behaviour of single-server retrial queues. These methods involve assuming that particular known algebraic relationships between various characteristics of the corresponding steady-state queue also apply approximately when the queue is not at steady-state. The objective is to replace a problem requiring the solution of dozens or hundreds of simultaneous linear differential equations with a system of a few differential equations that has a solution that approximates those queue characteristics of immediate interest. The viability of such closure methods is assessed by examining the results of a series of test calculations. The methods described in this thesis apply to a retrial queue in which inter-arrival times for new customers, inter-retrial times, and service times are all assumed to be exponentially distributed. The steady-state solution for such a queue is described in some detail. A survey of the literature indicates that the description of this steady-state retrial queue has become quite sophisticated, whereas only very tentative steps have been taken in the study of the time-dependent behaviour of such queues. On the other hand, the time-dependent behaviour of the simple M/M/s queues have been studied to a much greater extent. The apparent value of closure methods in computing approximations to various basic time-dependent M/M/s queue characteristics motivated this examination of the extension of such methods to the single-server retrial queue. After discussing the basic approach to be used in devising and testing prospective closure methods for the single-server retrial queue, a variety of such methods is presented, with each being tested in considerable detail. It is found that three of the methods devised give results of comparable or better accuracy than those closure methods for the simple M/M/s queues which motivated this study. All recommended closure methods developed here involve systems of either two or three differential equations and permit the calculation of good approximations to four of the characteristics of greatest interest for non-stationary queues: the probability that the server is idle, the mean queue length, the variance of the queue length, and the conditional mean number of customers in the system given that the server is idle. Each of the methods presented is tested for queues with constant mean arrival, retrial and service rates, as well as for queues in which arrival and retrial rates vary sinusoidally with time.
Science, Faculty of
Mathematics, Department of
Graduate

Gli stili APA, Harvard, Vancouver, ISO e altri

Chang, Woojin. "Asymptotics of k-limited polling models". Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/25507.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

程瑋琪 e Wai-ki Ching. "Construction of preconditioners for queueing networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B3121132X.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Srinivasan, Rengarajan Carleton University Dissertation Mathematics. "Topics in state dependent queues and queueing networks". Ottawa, 1988.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ching, Wai-ki. "Construction of preconditioners for queueing networks /". [Hong Kong] : University of Hong Kong, 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1378707X.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Libri sul tema "Queuing theory"

Johnston, Wilma Louise. Queuing theory. [s.l: The Author], 1994.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. Queuing Theory and Telecommunications. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75973-5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Gnedenko, B. V., e I. N. Kovalenko. Introduction to Queuing Theory. Boston, MA: Birkhäuser Boston, 1989. http://dx.doi.org/10.1007/978-1-4615-9826-8.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. Queuing Theory and Telecommunications. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Bocharov, P. P. Queueing theory. Utrecht: VSP, 2004.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kalashnikov, Vladimir V. Mathematical Methods in Queuing Theory. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Prabhu, N. U. Foundations of queueing theory. Boston: Kluwer Academic Publishers, 1997.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

S, Özekici, e Arab School on Science and Technology., a cura di. Queueing theory and applications. New York: Hemisphere Pub. Corp., 1990.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Takagi, Hideaki. Queueing analysis. Amsterdam: North-Holland, 1991.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Thomopoulos, Nick T. Fundamentals of Queuing Systems: Statistical Methods for Analyzing Queuing Models. Boston, MA: Springer US, 2012.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Capitoli di libri sul tema "Queuing theory"

Zonderland, Maartje E. "Basic Queuing Theory". In SpringerBriefs in Health Care Management and Economics, 13–26. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4899-7451-8_3.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Buckley, James J. "Fuzzy Queuing Theory". In Fuzzy Probabilities, 61–69. Heidelberg: Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-642-86786-6_5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Buckley, James J. "Fuzzy Queuing Theory". In Fuzzy Probabilities and Fuzzy Sets for Web Planning, 45–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-36426-9_5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kalashnikov, Vladimir V. "Queueing Theory". In Mathematical Methods in Queuing Theory, 5–15. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_1.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. "Survey on Probability Theory". In Queuing Theory and Telecommunications, 265–317. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Alfa, Attahiru Sule. "Single Node Queuing Models". In Queueing Theory for Telecommunications, 105–69. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-7314-6_4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. "Markov Chains and Queuing Theory". In Queuing Theory and Telecommunications, 319–65. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. "Introduction to Telecommunication Networks". In Queuing Theory and Telecommunications, 3–60. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_1.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. "Legacy Digital Networks". In Queuing Theory and Telecommunications, 61–127. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_2.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Giambene, Giovanni. "IP-Based Networks and Future Trends". In Queuing Theory and Telecommunications, 129–262. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-1-4614-4084-0_3.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Queuing theory"

Hohn, N., D. Veitch, K. Papagiannaki e C. Diot. "Bridging router performance and queuing theory". In the joint international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1005686.1005728.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Biao, Xu, Chen Hao, Xianqiong Wu, Wu Wei e Li Ce. "Journey Arrangements Based on Queuing Theory". In 2013 Fifth International Conference on Computational and Information Sciences (ICCIS). IEEE, 2013. http://dx.doi.org/10.1109/iccis.2013.183.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Usmanov, Vjacheslav, e Cenek Jarský. "Application of Queuing Theory in Construction". In 29th International Symposium on Automation and Robotics in Construction; Held jointly with the 8th World Conference of the International Society for Gerontechnology. International Association for Automation and Robotics in Construction (IAARC), 2012. http://dx.doi.org/10.22260/isarc2012/0048.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Lipsky, Lester, Dilip Tagare e Edward Bigos. "Evaluation of queuing system parameters using linear algebraic queuing theory---an implementation". In the 1990 ACM SIGSMALL/PC symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/99412.99467.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Nguyen, Dinh Son. "Application of queuing theory in service design". In 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2017. http://dx.doi.org/10.1109/ieem.2017.8290009.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Horling, Bryan, e Victor Lesser. "Using queuing theory to predict organizational metrics". In the fifth international joint conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1160633.1160829.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Mengyao, Yang. "Security Check Model Based on Queuing Theory". In 7th International Conference on Education, Management, Information and Computer Science (ICEMC 2017). Paris, France: Atlantis Press, 2017. http://dx.doi.org/10.2991/icemc-17.2017.59.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Vaghani, Kunj, Vivek Thakkar, Sumit Vaghasiya, Jignesh Thaker e Ashlesha Bhise. "Implementation of Queuing Theory in Emergency Departments". In 2024 IEEE International Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI). IEEE, 2024. http://dx.doi.org/10.1109/iatmsi60426.2024.10503130.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ryzhikov, Yuri. "Numerical methods of the queuing theory and their program realization". In Workshops (ICUMT). IEEE, 2009. http://dx.doi.org/10.1109/icumt.2009.5345319.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Sharma, Aseem, Krishna Jagannathan e Lav R. Varshney. "Information overload and human priority queuing". In 2014 IEEE International Symposium on Information Theory (ISIT). IEEE, 2014. http://dx.doi.org/10.1109/isit.2014.6874949.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Queuing theory"

Sullivan, Keith M., e Ian Grivell. QSIM: A Queueing Theory Model with Various Probability Distribution Functions. Fort Belvoir, VA: Defense Technical Information Center, marzo 2003. http://dx.doi.org/10.21236/ada414471.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Wornel, Gregory W. Fractal Point Process and Queueing Theory and Application to Communication Networks. Fort Belvoir, VA: Defense Technical Information Center, dicembre 1999. http://dx.doi.org/10.21236/ada375382.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!