排序方式: 共有25条查询结果,搜索用时 31 毫秒
1.
Stewart C Zieminski A Blessing S Crittenden R Draper P Dzierba A Heinz R Krider J Marshall T Martin J Sambamurti A Smith P Sulanke T Gomez R Dauwe L Haggerty H Malamud E Nikolic M Hagopian S Abrams R Ares J Goldberg H Halliwell C Margulies S McLeod D Salminen A Solomon J Wu G Ellsworth R Goodman J Gupta S Yodh G Watts T Abramov V Antipov Y Baldin B Denisov S Glebov V Gorin Y Kryshkin V Petrukhin A Polovnikov S Sulyaev R 《Physical review D: Particles and fields》1990,42(5):1385-1395
2.
Jesik R Abramov V Antipov Y Baldin B Crittenden R Dauwe L Davis C Denisov S Dyshkant A Dzierba A Glebov V Goldberg H Gribushin A Koreshev V Krider J Krinitsyn A Li R Margulies S Marshall T Martin J Mendez H Petrukhin A Sirotenko V Smith P Solomon J Sulanke T Sulyaev R Vaca F Zieminski A Blusk S Bromberg C Chang P Choudhary B Chung W de Barbaro L Dlugosz W Dunlea J Engels E Fanourakis G Ginther G Hartman K Huston J Kapoor V Lirakis C Lobkowicz F Mani S Mansour J Maul A Miller R Oh B Pothier E 《Physical review letters》1995,74(4):495-498
3.
Ohne Zusammenfassung
Dem Gedenken an Alfréd
Rényi
gewidmet 相似文献
4.
5.
6.
7.
8.
There are numerous means for measuring the closeness to planarity of a graph such as crossing number, splitting number, and
a variety of thickness parameters. We focus on the classical concept of the thickness of a graph, and we add to earlier work
in [4]. In particular, we offer new 9-critical thickness-two graphs on 17, 25, and 33 vertices, all of which provide counterexamples
to a conjecture on independence ratio of Albertson; we investigate three classes of graphs, namely singly and doubly outerplanar
graphs, and cloned planar graphs. We give a sharp upper bound for the largest chromatic number of the cloned planar graphs,
and we give upper and lower bounds for the largest chromatic number of the former two classes. 相似文献
9.
In this note, the GI/M/ queue with batch arrivals of constant sizek is investigated. It is shown that the stationary probabilities that an arriving batch findsi customers in the system can be computed in terms of the corresponding binomial moments (Jordan's formula), which are determined by a recursive relation. This generalizes well-known results by Takács [12] for GI/M/. Furthermore, relations between batch arrival- and time-stationary probabilities are given. 相似文献
10.
Robert A Sulanke 《Journal of Combinatorial Theory, Series A》1982,33(2):135-146
n-dimensional lattice paths are enumerated by generating functions which are Gaussian multinomial coefficients in the case of unrestricted paths. Convolutions for path counts are studied which yield a q-Vandermonde convolution and a determinant of Gaussian multinomial coefficients as the generating function for certain restricted paths. 相似文献