Academic literature on the topic 'G. A. M'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'G. A. M.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "G. A. M"

1

Kuruganti, R., and P. S. Sansgiry. "B(m,n)=G(m)G(n)/G(m + n)and volume of ann‐dimensional sphere." International Journal of Mathematical Education in Science and Technology 22, no. 3 (1991): 475–98. http://dx.doi.org/10.1080/0020739910220315.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vijayakumaran, K. P. "M G Sahadevan." BMJ 324, no. 7346 (2002): 1160i—1160. http://dx.doi.org/10.1136/bmj.324.7346.1160/i.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Aalto, Samuli, Urtzi Ayesta, and Eeva Nyberg-Oksanen. "M/G/1/MLPS compared to M/G/1/PS." Operations Research Letters 33, no. 5 (2005): 519–24. http://dx.doi.org/10.1016/j.orl.2004.09.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nakatsuka, Toshinao. "QUEUE LENGTH DISTRIBUTION IN M/G/1, M^x/G/1 AND THEIR VARIANTS WITH COMPLETION TIME." Journal of the Operations Research Society of Japan 52, no. 1 (2009): 11–34. http://dx.doi.org/10.15807/jorsj.52.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shang, Li, та HePing Zhang. "A general sufficient condition for a graph G with λ m (G) ⩽ ζ m (G)". Science China Mathematics 53, № 4 (2009): 1039–44. http://dx.doi.org/10.1007/s11425-009-0179-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Boxma, Onno, David Perry, and Wolfgang Stadje. "The M/G/1+G queue revisited." Queueing Systems 67, no. 3 (2011): 207–20. http://dx.doi.org/10.1007/s11134-010-9205-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dümmel, Siegfried. "On a theorem of M. G. Arsove." Mathematica Bohemica 117, no. 2 (1992): 159–67. http://dx.doi.org/10.21136/mb.1992.125903.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Schwenk, Allen J. "P. G. O. M." American Mathematical Monthly 96, no. 4 (1989): 382. http://dx.doi.org/10.1080/00029890.1989.11972204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

J., Joseline Manora, and Vignesh S. "Results on $\gamma_{M}^{-1}(G)$ and $\gamma_{M}^{-1}(\bar{G})$." Malaya Journal of Matematik S, no. 1 (2020): 358–62. http://dx.doi.org/10.26637/mjm0s20/0067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Friedlander, Eric M. "Restrictions to G(𝔽p) and G(r) of rational G-modules". Compositio Mathematica 147, № 6 (2011): 1955–78. http://dx.doi.org/10.1112/s0010437x11005562.

Full text
Abstract:
AbstractWe fix a prime p and consider a connected reductive algebraic group G over a perfect field k which is defined over 𝔽p. Let M be a finite-dimensional rational G-module M, a comodule for k[G]. We seek to somewhat unravel the relationship between the restriction of M to the finite Chevalley subgroup G(𝔽p)⊂G and the family of restrictions of M to Frobenius kernels G(r) ⊂G. In particular, we confront the conundrum that if M is the Frobenius twist of a rational G-module N,M=N(1), then the restrictions of M and N to G(𝔽p) are equal whereas the restriction of M to G(1) is trivial. Our analysis enables us to compare support varieties (and the finer non-maximal support varieties) for G(𝔽p) and G(r) of a rational G-module M where the choice of r depends explicitly on M.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "G. A. M"

1

Cantisano, Gabriela. "Aproximações para a fila M/G/s/r+G." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-22122009-184812/.

Full text
Abstract:
Este trabalho estuda medidas de desempenho aproximadas em centrais de atendimento, apresentadas pelo modelo M/G/s/r+G. As aproximações são calculadas a partir do modelo M/M/s/r+M(n). Os resultados foram extendidos para o caso de mais de um tipo de cliente, apresentado pelo modelo M/Mi/s/r+Mi(n). Para dois casos particulares com 2 tipos de clientes, as aproximações citadas foram avaliadas numericamente e comparadas com os resultados de referência obtidos através de simulação. Os resultados aproximados comprovam que a aproximação é bastante satisfatória.<br>We study approximations for performance measures of call centers, represented by M/G/s/r+G queueing model. We use the measures computed in the M/M/s/r+M(n) queueing model. The results were extended for more then one type of customer, represented by M/Mi/s/r+Mi(n) queueing model. For two particular cases with two types of customers, the mentioned approaches were numerically evaluated and compared with the results of reference obtained by simulation. The approximate results show that the approach is quite satisfactory.
APA, Harvard, Vancouver, ISO, and other styles
2

Keilson, Julian, and A. Seidmann. "M/G/ oo with Batch Arrivals." Massachusetts Institute of Technology, Operations Research Center, 1987. http://hdl.handle.net/1721.1/5138.

Full text
Abstract:
Let po(n) be the distribution of the number N(oo) in the system at ergodicity for systems with an infinite number of servers, batch arrivals with general batch size distribution and general holding times. This distribution is of impotance to a variety of studies in congestion theory, inventory theory and storage systems. To obtain this distribution, a more general problem is addressed . In this problem, each epoch of a Poisson process gives rise to an independent stochastic function on the lattice of integers, which may be viewed as a stochastic impulse response. A continuum analogue to the lattice process is also provided.<br>OR 169-87 Revised Version. Original copy, WP1932-87 September 1987, also enclosed was submitted to the University of Rochester.
APA, Harvard, Vancouver, ISO, and other styles
3

Oliveira, Camila Cardoso de. "Espera e abandono na fila M/M/n+G e variantes." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-21122009-171513/.

Full text
Abstract:
O modelo de fila M/M/n+G pode ser usado para descrever o comportamento de uma Central de Atendimento. Nesse modelo as chegadas são Poisson com taxa lambda, o atendimento é exponencialmente distribuído com taxa mi, há n atendentes e os tempos de paciência dos clientes têm distribuição geral. A espera do usuário em fila não pode ultrapassar um tempo (paciência) que tem distribuição G e, se isto ocorrer, ele abandona o sistema. Mandelbaum e Zeltyn [2004] mostraram que existe uma relação linear entre o tempo médio de permanência na fila e a probabilidade de abandono nesses modelos quando a paciência é exponencialmente distribuída. No presente trabalho, estudamos essa relação no caso de distribuiçãao de paciência do tipo mista (com partes discreta e contínua), em que buscamos representar a reação dos usuários às mensagens gravadas reproduzidas periodicamente para aqueles que estão esperando atendimento. Utilizamos duas distribuições de paciência: Exponencial Mista e Uniforme Mista e percebemos que não há uma relação linear entre o tempo médio de espera na fila e a probabilidade de abandono. Observamos que para uma mesma taxa de chegada, o tempo médio de espera na fila é menor para a distribuição de paciência mista quando comparada com a Exponencial ou Uniforme de mesmos parâmetros. Analisamos o que ocorre com essa relação quando alteramos a distribuição do atendimento e percebemos que ela é mais afetada pela média e pelo coeficiente de variação do que pela particular distribuição escolhida para o tempo de serviço.<br>The M/M/n+G queueing model can be used to describe the behavior of a Call Center. This model has Poisson arrivals with rate lambda, service times are exponentially distributed with rate mi, n agents and the client´s patience time has general distribution. The waiting in line could not exceed a time (patience) which has distribution G, and if it occurs, the client leaves the system. In this models, Mandelbaum and Zeltyn [2004] showed that there is a linear relationship between average waiting time in queue and the probability of abandonment if the distribution of patience is Exponencial. In this work, we study this relationship in the case of patience with mixed distribution (which has discret and continuous parts). Through mixed distributions we try to represent the user´s reaction to recorded messages reproduced periodically when they are waiting for service. We have used Mixed Exponencial and Mixed Uniform distributions and, in both of them, there is not a linear relationship between average waiting time in queue and the probability of abandonment. We observe that for the same arrival rate, the average waiting time in line for mixed distribution is smaller than Exponencial or Uniform distributions with the same parameters. Also, we study the effect on waiting time and abandonment of different distributions of service and we observe that it is more affected by the coeficient of variation and average that by the particular distribution chosen for service.
APA, Harvard, Vancouver, ISO, and other styles
4

Gibney, Angela Caroline. "Fibrations of M[subscript g], [subscript n] /." Digital version accessible at:, 2000. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Prado, Silvia Maria. "Modelos alternativos em filas M/G/1." Universidade Federal de São Carlos, 2015. https://repositorio.ufscar.br/handle/ufscar/8693.

Full text
Abstract:
Submitted by Aelson Maciera (aelsoncm@terra.com.br) on 2017-04-25T19:31:06Z No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)<br>Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-05-02T13:03:01Z (GMT) No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)<br>Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-05-02T13:03:17Z (GMT) No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)<br>Made available in DSpace on 2017-05-02T13:06:24Z (GMT). No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5) Previous issue date: 2015-11-26<br>Não recebi financiamento<br>The main aim of this work is to develop alternative queuing models to M/ G/l, in which arrivals follow a Poisson process, the total number of customers on the system and the total number of service channels are unknown. Our interest is just to observe the service channel that will offer the maximum or minimum service time. Wherefore, the service distributions are obtained from the composition of the Conwav-Maxwell-Poisson distribution truncated at zero, used to model the number of service channels, with the general distribution to the maximum and minimum service time. Thus, we obtain new distributions for service time, which are called Maximum-Conwav-Maxwell-Poisson-general, denoted by MAXCOMPG distribution, and Minimum-Conwav-Maxwell-Poisson-general, denoted by MINCOMPG distribution, consequently, we obtain the queue models M/MAXCOMPG/1 and M/MINCOMPG/ 1, respectively. As general distributions, we use the distributions exponential, Weibull and Birnbaum Saunders, To illustrate the proposed queue models, a simulation study is done and also real data are used.<br>Este trabalho tem como objetivo apresentar modelos de filas alternativos ao M/G/l, nos quais as chegadas seguem um processo de Poisson, o número total de usuários no sistema e o número total de canais de atendimento são desconhecidos. Neste caso, observamos apenas o canal de serviço que irá oferecer o máximo ou o mínimo tempo de serviço. Para isto, as distribuições de serviço são obtidas a partir da composição da distribuição Conwav-Maxwell-Poisson truncada no ponto zero, usada para modelar o número de canais de atendimento, com uma distribuição geral para o máximo e o mínimo tempos de serviço. Desta forma, surgem novas distribuições de serviço que são denominadas de Máximo-Conwav-Maxwell-Poisson-geral, denotada por distribuição MAXCOMPG, e Mínimo-Conwav-Maxwell-Poisson-geral, denotada por distribuição MINCOMPG, e, assim, obtemos os modelos de fila M MAXCOMPG 1 e M MINCOMPG 1. Como distribuições gerais usamos as distribuições exponencial, Weibull e Birnbaum Saunders, Para ilustrar os modelos de fila propostos um amplo estudo de simulação é feito e dados reais também são utilizados.
APA, Harvard, Vancouver, ISO, and other styles
6

Keilson, Julian, and Les D. Servi. "Networks of Non-homogeneous M/G/oo Systems." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5188.

Full text
Abstract:
For a network of G/oo service facilities, the transient joint distribution of the facility populations is found to have a simple Poisson product form with simple explicit formula for the means. In the network it is assumed that: a) each facility has an infinite number of servers; b) the service time distributions are general; c) external traffic is non-homogenous in time; d) arrivals have random or deterministic routes through the network possibly returning to the same facility more than once; e) arrivals use the facilities on their route sequentially or in parallel (as in the case of a circuit switched telecommunication network). The results have relevance to communication networks and manufacturing systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Yamanaka, Takeharu. "Vector fields in G¹(M) on 3-manifolds and their characterization = 3-jigen G¹(M) no bekutorujō to sono tokuchōzuke ni tsuite /." Electronic version of text Electronic version of summary Electronic version of examination, 2003. http://www.wul.waseda.ac.jp/gakui/honbun/3651/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Celis, Alvaro Nolla de. "DIHEDRAL GROUPS, G-HILB and M$\theta$(Q,R)." 名古屋大学多元数理科学研究科, 2009. http://hdl.handle.net/2237/12262.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Foti, Belligambi Valentino. "Bellezze cangianti : Beppe Fenoglio traduttore di G. M. Hopkins /." Milano : Ed. Unicopli, 2008. http://catalogue.bnf.fr/ark:/12148/cb41319942x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ben, Rhai͏̈em Henda. "L'étrangère dans l'oeuvre de J. M. G. Le Clézio." Paris 3, 1999. http://www.theses.fr/1999PA030070.

Full text
Abstract:
L'ecriture de j. M. G. Le clezio est passee d'une violence plutot controlee a une serenite violente. Les etrangeres lecleziennes, loin d'etre un support a une ecriture exotique, sont en verite fondatrices de ce changement dans l'ecriture impose depuis 1980. Tour a tour marginale, contrebandiere de la memoire et representante de populations declassees et humiliees l'etrangere participe a ce qu'il est desormais convenu de nommer &lt;&lt; mise en texte d'une difference &gt;&gt;, susceptible de lui donner autre chose qu'une silhouette exotique et d'insuffler aux recits lecleziens un air d'extraneite qui vaut d'originalite. Etre etranger n'est plus une question d'origine, mais d'attitude et celle-ci ne necessite pas toujours un deplacement spatial. Il n'est, en effet, plus possible de cerner le personnage del'etranger par rapport a une tradition qui exige que l'autre soit clairement defini par ses insignes, pour etre reconnu ou exclu mais toujours distingue. En cela, l'etrangere leclezienne se demarque des personnages feminins exotiques du siecle dernier tout en entretenant un rapport etroit avec les personnages des romans maghrebins de langue francaise sans pour cela y correspondre totalement. Definitivement inclassable, l'etrangere reste a la limite d'une quelconque classification, redefinissant de la sorte le discours sur l'alterite en opposition au monde occidental dont il faut se defaire<br>The writing of jean-marie gustave le clezio rather passed of a violence controlled to a violent serenity. The foreign leclezienneses, far to be a support to an exotic writing, are in founding truth of this change in the writing imposed since 1980. By turns marginal, smuggler of the memory and representative of relegated populations and humiliated, she participates in what it is agreed henceforth to name "mise in text of a difference ", susceptible to give her something else that an exotic silhouette and to inspire to narrations leclezienses a breath of extraneous that is worth originality. Foreign being is not anymore a question of origin, but of attitude, and this one doesn't require still a spatial displacement. It is not, indeed, more possible to surround the stranger's character in relation to a tradition that requires than the other is defined clearly by his badges, to be recognized excluded either but still distinguished. In it, the stranger's personage leclezienneses plagiarizes herself of the feminine characters exotic of the last century while maintaining a narrow report with french-speaking from the maghreb novel characters without for it there to correspond completely. Definitely unclassifiable, the stranger remains to the limit of an any classification, redefining of the way the speech on the extraneous in opposition to the western world of which it is necessary to come apart
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "G. A. M"

1

Harvey, Chris. M. G. Tiger Bks.International, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

J.-M. G. Le Clézio. Gallimard, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brown, Peter Harry. The M. G. M. girls: Behind the velvet curtain. Harrap, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hopkins, Gerard Manley. The sonnets of G. M. Hopkins. Kenkyusha, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Reisner, George Andrew. Amulets par M. G. A. Reisner. Martino Pub., 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pon̲māṇikkam, Maṇavai. Mar̲akka muṭiyāta māṃan̲itar M G R. Kar̲pakam Puttakālayam, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Onitsha: J.-M. G. Le Clézio. Bertrand-Lacoste, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Aprendiz de m-a-g-a. Editorial Horizonte, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aselēnois nyxi: G. Vizyēnos, M. Karapanou, G. Cheimōnas : treis psychanalytikes anagnōseis. Ekdoseis Epekeina, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Thalberg: The last tycoon and the world of M-G-M. Crown Publishers, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "G. A. M"

1

Brill, Percy H. "G/M/1 and G/M/c Queues." In Level Crossing Methods in Stochastic Models. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-50332-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fiddes, Paul S. "G. M. Hopkins." In The Blackwell Companion to the Bible in English Literature. Wiley-Blackwell, 2010. http://dx.doi.org/10.1002/9781444324174.ch40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Feldman, Richard S., Melissa Sapio, Miloslava Kozmová, et al. "Stratton, G. M." In Encyclopedia of the History of Psychological Theories. Springer US, 2012. http://dx.doi.org/10.1007/978-1-4419-0463-8_119.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brill, Percy H. "G/M/c Queues." In Level Crossing Methods in Stochastic Models. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-09421-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Uhrmann, Heimo, Robert Kolm, and Horst Zimmermann. "G m -C Filters." In Analog Filters in Nanometer CMOS. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-38013-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lipsky, Lester. "G/M/1 Queue." In Queueing Theory. Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-49706-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lipsky, Lester. "M/G/1 Queue." In Queueing Theory. Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-49706-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wiedenstried, Holger E. "Schmidt, Annie M. G." In Kindlers Literatur Lexikon (KLL). J.B. Metzler, 2020. http://dx.doi.org/10.1007/978-3-476-05728-0_20430-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Nelson, Randolph. "The M/G/1 Queue." In Probability, Stochastic Processes, and Queueing Theory. Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4757-2426-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Mona. "M/G/C-Type Systems." In Queueing Theory. Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-49706-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "G. A. M"

1

Wu, Ming, Fan Yang, Jilong Xue, et al. "G ra M." In SoCC '15: ACM Symposium on Cloud Computing. ACM, 2015. http://dx.doi.org/10.1145/2806777.2806849.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Khazaei, Hamzeh, Jelena Misic, and Vojislave B. Misic. "Modelling of Cloud Computing Centers Using M/G/m Queues." In 2011 31st International Conference on Distributed Computing Systems Workshops (ICDCS Workshops). IEEE, 2011. http://dx.doi.org/10.1109/icdcsw.2011.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chan, Wai Kin Victor, and Nowell Closser. "Sensitivity analysis of linear programming formulations for G/G/M queue." In 2013 Winter Simulation Conference - (WSC 2013). IEEE, 2013. http://dx.doi.org/10.1109/wsc.2013.6721460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schelasin, Roland E. A. "Estimating wafer processing cycle time using an improved G/G/M queue." In 2013 Winter Simulation Conference - (WSC 2013). IEEE, 2013. http://dx.doi.org/10.1109/wsc.2013.6721738.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

DUBNIČKA, S., and A. Z. DUBNIČKOVA. "IMPLICATIONS OF $G^{p}_{E}(Q^2)/G^{p}_{M}(Q^2)$." In Proceedings of the International Workshop. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812796950_0031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Noiri, Takashi, and Ahu Acikgoz. "On m* − g−closed sets and m* − R0 spaces in a hereditary m−space (X, m, H)." In THIRD INTERNATIONAL CONFERENCE OF MATHEMATICAL SCIENCES (ICMS 2019). AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pacheco, António, and Helena Ribeiro. "Consecutive customer loss probabilities in M/G/1/n and GI/M(m)//n systems." In Proceeding from the 2006 workshop. ACM Press, 2006. http://dx.doi.org/10.1145/1190366.1190374.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Si-Bo, Ding, and Huang Wei-lai. "Reverse Logistics Optimization Based on GI/G/m." In 2007 International Conference on Service Systems and Service Management. IEEE, 2007. http://dx.doi.org/10.1109/icsssm.2007.4280250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, DJ, Lixin Wang, and Robert Havey. "Measuring cycle time through the use of the queuing theory formula (G/G/m)." In 2014 Winter Simulation Conference - (WSC 2014). IEEE, 2014. http://dx.doi.org/10.1109/wsc.2014.7020085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

PENTCHEV, L., C. F. PERDRISAT, and B. WOJTSEKHOWSKI. "HIGH Q2 LARGE ACCEPTANCE $G^{p}_{E}/G^{p}_{M}$ MEASUREMENTS USING POLARIZATION TRANSFER." In Proceedings of the International Workshop. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812796950_0032.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "G. A. M"

1

Tsoukatos, Konstantinos P., and Armand M. Makowski. Interpolation Approximations for M/G/infinity Arrival Processes. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada442652.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Serfozo, Richard F. Extreme Values of Queue Lengths in M/G/1 and GI/M/1 Systems. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada177117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Krakowski, Martin. M/G/1 with Exceptional Service and Arrival Rate. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada201369.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Krakowski, Martin. System Size and Remaining Service in M/G/1. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Sung S., and Richard F. Serfozo. Optimal Idle and Inspection Periods for M/G/1 Queues,. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada170110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Brill, Percy H., and Carl M. Harris. Waiting Times for M/G/1 Queues with Service-Time-Dependent Server Vacations. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada209597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Parulekar, Minothi, and Armand M. Makowski. M/G/infinity Input Process: A Versatile Class of Models for Network Traffic. Defense Technical Information Center, 1996. http://dx.doi.org/10.21236/ada455586.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kachru, Shamit. M-theory on Manifolds of G{sub 2} Holonomy and Type IIA Orientifolds. Office of Scientific and Technical Information (OSTI), 2001. http://dx.doi.org/10.2172/784969.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hautbout, Isabelle. The Resurrection Man, le héros du mal des Mysteries of London de G. W. M. Reynolds. Edicions de la Universitat de Lleida, 2018. http://dx.doi.org/10.21001/luc.21.22.02.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Habarakada Liyanage, Anusha Pushpakumari. Proton form factor ratio, μpGEP/GMP from double spin asymmetry. Office of Scientific and Technical Information (OSTI), 2013. http://dx.doi.org/10.2172/1105955.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography