Zobrazeno 1 - 10
of 1 514
pro vyhledávání: '"BRAMSON M"'
Autor:
Bramson, M., Liggett, T. M.
Publikováno v:
Annals of Probability 2005, Vol. 33, No. 6, 2255-2313
There has been significant progress recently in our understanding of the stationary measures of the exclusion process on $Z$. The corresponding situation in higher dimensions remains largely a mystery. In this paper we give necessary and sufficient c
Externí odkaz:
http://arxiv.org/abs/math/0602098
Autor:
Bramson, M., Lebowitz, J. L.
Consider the system of particles on ${\Bbb Z}^d$ where particles are of two types, $A$ and $B$, and execute simple random walks in continuous time. Particles do not interact with their own type, but when a type $A$ particle meets a type $B$ particle,
Externí odkaz:
http://arxiv.org/abs/math-ph/0003022
Autor:
Bramson, M., Liggett, T. M.
Publikováno v:
The Annals of Probability, 2005 Nov 01. 33(6), 2255-2313.
Externí odkaz:
https://www.jstor.org/stable/3481783
Publikováno v:
The Annals of Applied Probability, 1992 Aug 01. 2(3), 575-596.
Externí odkaz:
https://www.jstor.org/stable/2959715
Publikováno v:
The Annals of Probability, 1989 Apr 01. 17(2), 444-481.
Externí odkaz:
https://www.jstor.org/stable/2244276
Publikováno v:
Operational Research Quarterly (1970-1977), 1970 Jun 01. 21, 45-67.
Externí odkaz:
https://www.jstor.org/stable/3007913
Autor:
Roberts, P. C., Bramson, M. J.
Publikováno v:
OR, 1969 Apr 01. 20, 71-85.
Externí odkaz:
https://www.jstor.org/stable/3008681
Autor:
Bramson, M. J.
Publikováno v:
OR, 1962 Mar 01. 13(1), 41-53.
Externí odkaz:
https://www.jstor.org/stable/3007578
Autor:
Bramson, M. J., Pennycuick, K., Day, J., Stringer, J., Welding, P. I., Wilford, A. T., Barnett, M. P., Hankin, B. D., Smeed, R. J., Bennett, M. G.
Publikováno v:
OR, 1957 Sep 01. 8(3), 142-148.
Externí odkaz:
https://www.jstor.org/stable/3007158
Autor:
Bramson, M, Williams, R J
Publikováno v:
Bramson, M; & Williams, R J. (2003). Two workload properties for Brownian networks. Queueing Systems, 45(3), 191-221. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/75v7x61b
As one approach to dynamic scheduling problems for open stochastic processing networks, J.M. Harrison has proposed the use of formal heavy traffic approximations known as Brownian networks. A key step in this approach is a reduction in dimension of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::9206b52820f9b1553ce3748bf46d9902
http://www.escholarship.org/uc/item/75v7x61b
http://www.escholarship.org/uc/item/75v7x61b