Search

Search Funnelback University

Search powered by Funnelback
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. Analysis of Peer-to-Peer File Dissemination Jochen Mundinger∗,…

    www.statslab.cam.ac.uk/~rrw1/publications/Mundinger%20-%20Weber%20-Weiss%202006%20Analysis%20of%20peer-to-peer%20file%20dissemination.pdf
    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.
  4. A Self-Organizing Bin Packing HeuristicJanos Csirik � David S. ...

    www.statslab.cam.ac.uk/~rrw1/publications/Csirik%20-%20Johnson%20-%20Kenyon%20-%20Shor%20-%20Weber%201999%20A%20self-organizing%20bin%20packing%20heuristic.pdf
    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
  5. Effective Bandwidths for Stationary Sources

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201995%20Effective%20bandwidths%20for%20stationary%20sources.pdf
    15 Sep 2011: 10. Abuffer of 200 ATM cells, each of 54 bytes, of 8 bits, is about B = 80.
  6. An on-line Estimation Procedure forCell-Loss Probabilities in ATM…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-%20Weber%201995%20A%20on-line%20estimation%20procedure%20for%20cell-loss%20probabilities.pdf
    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
  7. 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
  8. On an Index Policy for Restless Bandits

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Weiss%201990%20On%20an%20index%20policy%20for%20restless%20bandits.pdf
    15 Sep 2011: In state 2 the passive rates q2i are chosen to be 200 times the active ones qi.
  9. 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
  10. Optimal Call Routing in VoIPCostas Courcoubetis Department of…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kalogiros%20-%202009%20Weber%20Optimal%20call%20routing%20in%20VoIP.pdf
    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
  11. 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.

Refine your results

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.