Search
Search Funnelback University
- Refined by:
- Date: 2011
51 -
58 of
58
search results for TALK:PC53 20 |u:www.statslab.cam.ac.uk
where 0
match all words and 58
match some words.
Results that match 1 of 2 words
-
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: z(i, i - 1). Min[c() h(i) Xiz(i 1, i)] (20) - mmn i)]}. ... 20. The optimal service rate for each state xi depends only on i, the number of customers in the system, and not on xl,. , -
3954
www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%202002%20Perfect%20packing%20theorems%20and%20the%20average%20case%20behavior%20of%20optimal%20and%20online%20bin%20packing.pdf15 Sep 2011: U(0, 1] Ref U{j,k}, j = k 1,k RefOPT , FFD, BFD Θ(n1/2) [20, 21] Θ(n1/2) [10]SS – – Θ(n1/2k1/2)† [12]FF ... Algorithms, 27 (1998), pp. 218–235. [20] W. Knödel, A bin packing algorithm with complexity o(nlogn) in the stochastic limit, -
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: Θ(n1/2 log3/4 n), k = (n) [5]. Best on-line Θ(n1/2 log1/2 n) [19, 20] k(n1/2)† [–]. U(0, u], u < 1 Ref U{j, ... Best on-line Θ(n1/2 log1/2 n), [19, 20] Ok(1), Θk(n1/2), Θk(n) [9]. -
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: Fundamental Discrepancies Between Average-Case Analyses. Under Discrete and Continuous Distributions:. A Bin Packing Case Study. E.G Coffman, Jr. 1, C. Courcoubetis 1‘2, M. R. Gareyl, D. S. Johnsonl. L. A. McGeoch3, P. W. Shorl, R. R. Weber4, M. -
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 -
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: 3). Thus,22. (a) instance L of continuous problem(b) instance L(k). k = 91=20. -
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: Queueing Systems 13 (1993) 291-314 291. A survey of Markov decision models for control of networks of queues. Shaler S t i d h a m jr.1. Department of Operations Research, CB 3180, Smith Building, University of North Carolina, ChapelHill, -
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
Recent searches
Your search history is empty.