نتایج جستجو برای: krasner m
تعداد نتایج: 538935 فیلتر نتایج به سال:
مساله مکان?یابی ماکزیمم پوشش از جمله پرکاربردترین مسائل مکان?یابی محسوب می شود. در این مساله هدف تعیین مکان p مرکز سرویس و تخصیص نقاط تقاضا به آنها به گونه ای است که جمعیت سرویس داده شده ماکزیمم شود. یک از معیارهایی که موجب افزایش کیفیت خدمات رسانی توسط مراکز سرویس می شود، توجه به میانگین زمان انتظار در مراکز سرویس می باشد. در این رساله سه مساله مکان یابی ماکزیمم پوشش مورد بررسی قرار می گیرد....
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
ion Spaces". Artificial Intelligence 5, 2 (1974),8. Fink, P. K. and Biermann, A. W. "The Correction of 115-135.Ill-Formed Input Using History-Based Expectation WithApplications to Speech Understanding". Computational 22. Searle, J. R. Indirect Speech Acts. In Syntax and Linguistics 12 (1986), 13-36.Semantics, Volume 3: Speech Acts, New York: Academic Press, 1975.9. Gatward, ...
The object of the investigation is to study reducible $M$-ideals in Banach spaces. It is shown that if the number of $M$-ideals in a Banach space $X$ is $n(<infty)$, then the number of reducible $M$-ideals does not exceed of $frac{(n-2)(n-3)}{2}$. Moreover, given a compact metric space $X$, we obtain a general form of a reducible $M$-ideal in the space $C(X)$ of continuous functions on $X$. The...
According to Timothy Morton Lawrence’s “ecological awareness” has a fivefold basis: rousseauesque critique of civilization, the cultural pessimism late nineteenth century, experience growing up in an environment profoundly affected by industrialization, his religious background, and First World War. With this point departure, he sought alternative solutions periphery as opposed centre, body rat...
Given a model M and a temporal logic formula φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M |= φ[? ← f ]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study ...
The aim of this paper is to give a direct approach to the study of the Sylow ^-subgroups Sn of the symmetric group of degree pn. [We assume throughout that p^2.] Many of the results are already known and are treated in a paper by Kaloujnine where he uses a particular representation by means of "reduced polynomials."1 It has seemed worth while to restate some of his results using the concept of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید