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
31 - 40 of 2,373 search results for katalk:PC53 24 / where 0 match all words and 2,373 match some words.

  1. Results that match 1 of 2 words

  2. 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: A crude estimate of the variance of the logi estimator is given by2i = 1M 1 8><>: MXj=1(yi;j yi)2 1M 24 MXj=1(yi;j yi)3529>=>;

  3. Minimizing Expected Makespans on Uniform Processor Systems

    www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20Garey%20Flatto%20Weber%201987%20Minimizing%20expected%20makespan%20on%20uniform%20processor%20systems.pdf
    18 Sep 2011: 1 (3.24) Cl(a, k 1)= C(a 3, k - 1). 1+ Y2. ... 1 Y2 3. Comparison of (3.24) and (3.25) yields C2(a, k 1) < Cl(a,.

  4. 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.pdf
    15 Sep 2011: E[w(t]) (u2n1/2/8)[nu/8 nu/24] = u3n1/2/96. This implies. E. [1n. n. t=1. ... w(t). ] u3n1/2/192. On the other hand, ifn1s=0 P(υ(s) n1/2) nu/24, then.

  5. 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.

  6. 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: additional gaps of size 1, for a total of 23 m/24.

  7. 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: If E sb = k n6 (pnk) ; (4.1)24. then E[WFF (L)] = (pnk).Proof.

  8. 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: open question of whether there exist distributionsof thii form for which Best Fit yields linearly-growing waste.The proof of the latter theorem relies on a 24-hour computation,and although ... Similar arguments work for U{9,12} with t = 19 and22 = 814,

  9. 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.pdf
    15 Sep 2011: Let. (24) Ei = Pi= F(E,). and for i = 1, 2 define the events.

  10. On the Optimality of LEPT and c Rules for Machines in Parallel

    www.statslab.cam.ac.uk/~rrw1/publications/Chang%20...%20Weber%201992%20On%20the%20optimality%20of%20LEPT%20and%20cu%20rules%20for%20machines%20in%20parallel.pdf
    15 Sep 2011: Prob. 24(3). CHANG, C. S. AND YAO, D. D. (1990) Rearrangement, majorization and stochastic scheduling. ... machines. J. Appl. Prob. 24, 430-448. KAMPKE, T. (1989) Optimal scheduling of jobs with exponential service times on identical parallel.

  11. p2pw6.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Antoniadis%20-%20Courcoubetis%20-%20Weber%202004%20An%20Asymptotically%20Optimal%20Scheme%20for%20P2P%20File%20Sharing.pdf
    15 Nov 2011: Each of the peers whohas θ = 0.5 makes net benefit of 24.6390. ... Under this mechanism,the peers who have θ = 0.5 will now make a greater netbenefit of 24.6975.

Refine your results

Format

clear all

Date

Related searches for katalk:PC53 24 /

By site

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.