Search
Search Funnelback University
- Refined by:
- Date: 2011
41 -
49 of
49
search results for TALK:Vb20 24 / |u:www.statslab.cam.ac.uk
where 0
match all words and 49
match some words.
Results that match 1 of 2 words
-
Optimal Selection of Stochastic Intervals under a Sum Constraint
www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20-%20Flatto-%20Weber%201987%20Optimal%20selection%20of%20stochastic%20intervals%20under%20a%20sum%20constraint.pdf15 Sep 2011: Let. (24) Ei = Pi= F(E,). and for i = 1, 2 define the events. -
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.pdf15 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. -
MunWebWei06JoS_2.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Mundinger%20-%20Weber%20-%20Weiss%202008%20Optimal%20scheduling%20of%20peer-to-peer%20file%20dissemination.pdf15 Sep 2011: Optimal Scheduling of Peer-to-Peer File Dissemination. Jochen Mundinger, Richard Weber† and Gideon Weiss‡. Abstract. Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increas-ingly used for disseminating potentially large -
Monotonic and Insensitive Optimal Policies for Control of Queues with …
www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201989%20Monotonic%20and%20insensitive%20optimal%20policies%20for%20control%20of%20queues%20with%20undiscounted%20costs.pdf15 Sep 2011: Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted CostsAuthor(s): Shaler Stidham Jr. and Richard R. WeberSource: Operations Research, Vol. 37, No. 4 (Jul. - Aug., 1989), pp. 611-625Published by: INFORMSStable URL: -
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.pdf15 Sep 2011: additional gaps of size 1, for a total of 23 m/24. -
Preprint 0 (2000) 1{22 1Telecommunication Systems, 15(3-4):323-343,…
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Siris%20-%20Weber%202000%20A%20study%20of%20simple%20charging%20schemes%20for%20broadband%20networks.pdf15 Sep 2011: Hence, if T is the duration of a trace segment j then the eectivebandwidth aj for a connection whose trac is given by this segment is computedfrom j = 1st log 24 -
A survey of Markov decision models for control of networks of queues
www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201993%20A%20survey%20of%20Markov%20decision%20models%20for%20control%20of%20networks%20of%20queues.pdf15 Sep 2011: Weber [66], Foschini and Salz [24], Ephremides et al. -
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.pdf15 Sep 2011: If E sb = k n6 (pnk) ; (4.1)24. then E[WFF (L)] = (pnk).Proof. -
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
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
- gambling |u:www.cam.ac.uk (0) · moments ago
- `WATSON AND DR` |u:www.reporter.admin.cam.ac.uk (2) · moments ago
Recent searches
Your search history is empty.