Search
Search Funnelback University
- Refined by:
- Date: 2011
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.
Results that match 1 of 2 words
-
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.pdf15 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 -
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.pdf15 Sep 2011: In state 2 the passive rates q2i are chosen to be 200 times the active ones qi. -
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.pdf18 Sep 2011: 200 Shaler Stidhaln. /1'. and Richard R. W'eber. (. ) c(ll) f(. ). -
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.pdf15 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. -
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.pdf15 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 -
jacm.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Csirik%20-%20Johnson%20-%20Kenyon%20-%20Orlin%20-%20Shor%20-%20Weber.2000%20%20On%20the%20sum-of-squares%20algorithm%20for%20bin%20packing.pdf15 Sep 2011: On the Sum-of-Squares Algorithm for Bin Packing. JANOS CSIRIK. University of Szeged, Szeged, Hungary. DAVID S. JOHNSON. AT&T Labs - Research, Florham Park, New Jersey. CLAIRE KENYON. Brown University, Providence, Rhode Island. JAMES B. ORLIN and -
1034 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. ...
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202006%20%20Incentives%20for%20large%20peer-to-peer%20systems.pdf15 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 -
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.pdf15 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 -
Effective Bandwidths for Stationary Sources
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201995%20Effective%20bandwidths%20for%20stationary%20sources.pdf15 Sep 2011: 10. Abuffer of 200 ATM cells, each of 54 bytes, of 8 bits, is about B = 80. -
paper3.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Weber%202000%20Measurement%20based%20charging%20in%20communication%20networks.pdf15 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
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.