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
21 - 30 of 43 search results for `all b B` |u:www.statslab.cam.ac.uk

  1. Fully-matching results

  2. Admission control and routing in ATM networks using inferences from…

    https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kesidis%20-%20Ridder%20-%20Walrand%20-Weber%201995%20Admission%20control%20and%20routing%20in%20ATM%20networks%20using%20inferences%20from%20measured%20buffer%20occupancy.pdf
    15 Sep 2011: Denote by F, = F ( N n r B n , c n ) the current fraction of cells lost a t buffer n, for all buffers n in the network. ... Under these assumptions, D will have a negligible dependence on B as well (for large B ). Consequently, the probability t h a t

  3. Necessary and Sufficient Conditions for Stability of a Bin-Packing…

    https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201986%20Necessary%20and%20sufficient%20conditions%20for%20stability%20of%20a%20bin-packing%20system.pdf
    15 Sep 2011: Thus the. expected wasted space is bounded by some B for all t. ... Thus the wasted space satisfies I B' I|1/N < Wt' | I B' I|1N for all possible packings.

  4. LiuWeberZhao11CDC_revised.dvi

    https://www.statslab.cam.ac.uk/~rrw1/publications/Liu%20-%20Weber%20-%20Zhao%202011%20Indexability%20and%20Whittle%20Index%20for%20restless%20bandit%20problems%20involving%20reset%20processes.pdf
    31 Oct 2011: From the above, the minimum subsidy that makes (1, 1)passive also makes all states passive. ... 1. We shallprove by induction on s that that for all valid state vectors(ω̄1, y, ω̄2, ω̄3).

  5. Z:/helmut/Projekte/JUCS_2008/accepted_papers/Soursos/source_files/sour…

    https://www.statslab.cam.ac.uk/~rrw1/publications/Souros%20-%20Courcoubetis%20-Weber%202008%20Dynamic%20bandwidth%20pricing%20Provision%20cost%20market%20size%20effective%20bandwidths%20and%20price%20games.pdf
    15 Sep 2011: Note that not all n customers will choose a dynamic contract, butwe will address this issue later on. ... of band-width, while with probability 1pi he does not buy nothing at all, with pi beinguniform in [0, a/b].

  6. Markov Chains, Computer Proofs, andAverage-Case Analysis of Best Fit…

    https://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: Mtisfies (b) for all StMM with a 111-ponent of value k or bigger by (2.2) and the fact that M isk-liiited. ... The newfunction has all positive coefficients and will continue tosatisfy (b) with y replaced by y/2 >0.

  7. Scheduling Jobs with Stochastic Processing Requirements on Parallel…

    https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201982%20Scheduling%20jobs%20with%20stochastic%20processing%20requirements%20on%20parallel%20machines%20to%20minimize%20makespan%20or%20flowtime.pdf
    15 Sep 2011: manner until all machines are assigned or all jobs are allocated to machines. ... The uniform, exponential, hyperex- ponential, gamma, and folded-normal distributions all have sc2 densities.

  8. 3954

    https://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: 1, 0, 2).Let PS,b denote the set of all perfect packing configurations for a given S and b. ... LetΛS,b be the convex cone in Rd spanned by all nonnegative linear combinations ofconfigurations in PS,b.

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

    https://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: Then 7r minimizes E[ J', cj Uj] amongst all the static list policies. ... All the jobs are present at time 0, so T7 = SJ Qr ,dt.

  10. Fundamental Discrepancies Between Average-Case Analyses Under…

    https://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: b) The worst possible growth rate for expected waste. of FFD over all pairs j,k is n1624 = (.00160. ) ... 1,0,2). Let P,B denote the set of all perfect packing. configurations for a given S and B.

  11. A Self-Organizing Bin Packing HeuristicJanos Csirik � David S. ...

    https://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: Place the next item so as to minimize P1i<B n(g)2.For all the discrete distributions we have tested, SS appears to produce sublinearexpected waste whenever the optimal expected ... assume that all discrete distributions have beenscaled up by an

Refine your results

clear all

Date

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.