Search

31 Oct 2011: Spreadsheet programs like Microsoft Excel and Quattro Pro also contain LP solvers that are good for up to about 200 variables.

31 Oct 2011: Spreadsheet programs like Microsoft Excel and Quattro Pro also contain LP solvers that are good for up to about 200 variables.

30 Nov 2011: The Annals of Applied Probability2009, Vol. 19, No. 5, 1719–1780DOI: 10.1214/08-AAP591 Institute of Mathematical Statistics, 2009. STATE SPACE COLLAPSE AND DIFFUSION APPROXIMATIONFOR A NETWORK OPERATING UNDER A FAIR BANDWIDTH. SHARING POLICY. BY

14 Nov 2011: 0 50 100 150 200. 5. 10. 15. 20. 0 50 100 150 200.

15 Sep 2011: actualgoal. 1e-09. 1e-08. 1e-07. 1e-06. 1e-05. 0 50 100 150 200. ... 1e-10. 1e-09. 1e-08. 1e-07. 1e-06. 0 50 100 150 200. QoS.

15 Sep 2011: 4492 0.4561 log2 N 0.9719 0.3334 1.4514 0.3661 log2 N 0.9676 0.2505 1.4812 0.3045 log2 N 0.9690 0.200.

15 Sep 2011: This is technically pseudo-polynomial time, but is quite feasi-ble for bin capacities of 200 or more.Although SS appears to be essentially optimal when the expected optimal waste issublinear, ... for B as large as 200 or more.We use this LP-based

15 Sep 2011: 10. Abuffer of 200 ATM cells, each of 54 bytes, of 8 bits, is about B = 80.

15 Sep 2011: However, if we measure the loss rate p in a virtualsubsystem", that is carrying 200 sources and has bandwidth and buer space equal to the one-fthof the corresponding values of

15 Sep 2011: One cannot say the same for the approach that assumes the buffer is large; in many ATM switch designs, the total buffer space may be moderate, say 100-200 cells. ... Of course there is the opportunity to make five independent estimates of p, using five

15 Sep 2011: In state 2 the passive rates q2i are chosen to be 200 times the active ones qi.

18 Sep 2011: 200 Shaler Stidhaln. /1'. and Richard R. W'eber. (. ) c(ll) f(. ).

15 Sep 2011: bution, one with N = 100,000,000 and one with N =200,000,000, but for each we report the average value ofthe waste over all steps of the packing. ... 51211.14102614.05. 12.6412.61. TABLE1. Waste under Best Fit for U{ J, K), averaged overruns of 100- and

15 Sep 2011: Optimal Call Routing in VoIPCostas Courcoubetis. Department of Computer ScienceAthens University. of Economics and Business47A Evelpidon StrAthens 11363, GR. Email: courcou@aueb.gr. Costas KalogirosDepartment of Computer Science. Athens Universityof

15 Sep 2011: Weassume that a customer is policed by two leaky buckets h = f(h;0);(;)g, and initiallyassume that trac is shaped in a 200 ms buer.

18 Sep 2011: 200 E. G. COFFMAN JR ET AL. Now suppose that k IaI > K, a 1, and (as, k) is stable. ... p. 199. p. 200. p. 201. Issue Table of Contents. Advances in Applied Probability, Vol.

15 Sep 2011: 200. 150. j. 100d $“1’! ,.,Ijl“l!’.f”ll’. ,,,(!1 :50 -. 1, 1 I 1’. ... f”[. , ,.::: I ‘. 01”! t. o 100 200 300 400 5(k.

15 Sep 2011: 000=22:4 = 6;920connections.Suppose the switch has a buer of 200 ATM cells (= 84:4k bits, since a cell is 53 bytes.)Solving so that (2) gives about

15 Sep 2011: THE CAFETERIA PROCESS-TANDEM QUEUES WITH 0-1 DEPENDENT SERVICE TIMES AND THE. BOWL SHAPE PHENOMENON. RICHARD R. WEBER University of Cambridge, Cambridge, England. GIDEON WEISS Georgia Institute of Technology, Atlanta, Georgia. (Received December 1991

15 Sep 2011: 1034 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 24, NO. 5, MAY 2006. Incentives for Large Peer-to-Peer SystemsCostas Courcoubetis and Richard Weber. Abstract—We consider problems of provisioning an excludablepublic good amongst