Search

Search Funnelback University

Search powered by Funnelback
10 results 20 results 50 results
Relevance Date (Newest first) Date (Oldest first) Title (A-Z) Title (Z-A) Distance URL (A-Z) URL (Z-A) Shuffle
1 - 10 of 25 search results for KaKaoTalk:vb20 200 |u:www.statslab.cam.ac.uk where 0 match all words and 25 match some words.

  1. Results that match 1 of 2 words

  2. On the Performance of an E�ective Bandwidths FormulaCostas…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-Weber%201994%20On%20the%20performance%20of%20an%20effective%20bandwidths%20formula.pdf
    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.

  3. The Cafeteria Process-Tandem Queues with 0-1 Dependent Service Times…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Weiss%201994%20The%20cafeteria%20process,%20tandem%20queues%20with%20dependent%200-1%20service%20times%20and%20the%20bowl%20shape%20phenomenon.pdf
    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

  4. To appear in RANDOM STRUCTURES AND ALGORITHMSBin Packing with ...

    www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20-%20Johnson%20-%20Shor%20-%20Weber%201996%20Bin%20packing%20with%20discrete%20item%20sizes%20Part%20II.pdf
    15 Sep 2011: To appear in RANDOM STRUCTURES AND ALGORITHMSBin Packing with Discrete Item Sizes,Part II: Tight Bounds on First FitE. G. Coman, Jr.,Bell Labs, Lucent TechnologiesMurray Hill, New Jersey 07974D. S. Johnson, P. W. ShorAT&T LabsMurray Hill, New Jersey

  5. Fundamental Discrepancies Between Average-Case Analyses Under…

    www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%201991%20Fundamental%20discrepancies%20between%20average-case%20analyses%20under%20discrete%20and%20continuous%20distributions%20A%20bin%20packing%20case%20study.pdf
    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.

  6. CHAPTER 13 MONOTONE OPTIMAL POLICIES FOR LEFT-SKIP-FREE MARKOV…

    www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201999%20Monotone%20optimal%20policies%20for%20left-skip-free%20Markov%20decision%20processes.pdf
    18 Sep 2011: 200 Shaler Stidhaln. /1'. and Richard R. W'eber. (. ) c(ll) f(. ).

  7. State space collapse and diffusion approximation for a network…

    www.statslab.cam.ac.uk/~frank/PAPERS/AAP591.pdf
    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

  8. Buffer Overflow Asymptotics for a Buffer Handling Many Traffic Sources

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201996%20%20Buffer%20overflow%20asymptotics%20for%20a%20switch%20handling%20many%20traffic%20sources.pdf
    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

  9. bc98_crc_with_ref.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Siris%20-%20Weber%201998%20A%20Study%20of%20simple%20usage-based%20charging%20schemes%20for%20broadband%20networks.pdf
    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.

  10. P:TEXSIDMA�-3Õ93Õ93

    www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%202000%20Bin%20packing%20with%20discrete%20item%20sizes,%20Part%20I%20Perfect%20packing%20theorems.pdf
    15 Sep 2011: BIN PACKING WITH DISCRETE ITEM SIZES, PART I: PERFECTPACKING THEOREMS AND THE AVERAGE CASE BEHAVIOR OF. OPTIMAL PACKINGS. E. G. COFFMAN, JR.†, C. COURCOUBETIS‡, M. R. GAREY, D. S. JOHNSON,P. W. SHOR, R. R. WEBER‖, AND M. YANNAKAKIS. SIAM J.

  11. Markov Chains, Computer Proofs, andAverage-Case Analysis of Best Fit…

    www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20-%20Johnson%20-%20Shor%20-%20Weber%201993%20Markov%20chains,%20computer%20proofs,%20and%20average-case%20analysis%20of%20best%20fit%20bin%20packing.pdf
    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

Refine your results

clear all

Date

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.