Search

Search Funnelback University

Search powered by Funnelback
71 - 80 of 84 search results for news |u:www.statslab.cam.ac.uk
  1. Fully-matching results

  2. 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: Johnson, P. W. ShorAT&T LabsMurray Hill, New Jersey 07974R. R. WeberCambridge UniversityCambridge, England1. ... The new matching produced from MFF is not necessarily an MFF matching (seeFig.
  3. 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.pdf
    15 Sep 2011: We use information technology and tools to increase productivity and facilitate new formsof scholarship. ... Assume that new jobs arrive to the system according to a state- dependent Poisson process with mean rate Xi, i - 0.
  4. 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.pdf
    15 Sep 2011: 2. a "new" particle is added at location k (we may now have two particles in location k);. ... Note that in the modified system the new particle always becomes the right- most particle.
  5. MunWebWei06JoS_2.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Mundinger%20-%20Weber%20-%20Weiss%202008%20Optimal%20scheduling%20of%20peer-to-peer%20file%20dissemination.pdf
    15 Sep 2011: By contrast, we provide an analytic performance analysisthat is based on a new uplink-sharing version of the well-known broadcasting problem.Assuming equal upload capacities, we show that the minimal ... Wework with a new uplink-sharing model that is
  6. Cambridge Compromise

    www.statslab.cam.ac.uk/~grg/afco.pdf
    17 Feb 2011: I • blocks of States with similar populations can be forced tohave equal numbers of seats, and• the accession of a new state can impose equality over agreater range of populations.
  7. 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.pdf
    15 Sep 2011: A METHOD BASED ON PIECEWISE-LINEAR INTERPOLATION. Bartroli [5] presents a new mechanism for inductive proofs o f m o n o t o n i c i t y o
  8. 10 Oct 2011: A close inspection of the proofs revealsthat the consistency results in Theorem 2.1 and Corollary 2.2 carry over to this new version.
  9. EUROPEAN APPORTIONMENT VIA THECAMBRIDGE COMPROMISE GEOFFREY R.…

    www.statslab.cam.ac.uk/~grg/papers/USep4.pdf
    22 Aug 2011: Durable: A formula that adapts naturally to possible structural changesin the architecture of the EU, arising for example through accessionsby new States, through migration, or through demographic shifts. ... Since each State receives by necessity an
  10. A POWER-WEIGHTED VARIANT OF THE EU27 CAMBRIDGE COMPROMISE G. ...

    www.statslab.cam.ac.uk/~grg/papers/USmss8rev1.pdf
    2 Sep 2011: 4. As new States accede, the exponents E that achieve x1(E) = 96 approachunity.
  11. 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.pdf
    15 Sep 2011: In the first case it starts a new. Journal of the ACM, Vol. ... In the latter case we start a new bin. SS′. works as follows.

Refine your results

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.