Search

Search Funnelback University

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

  2. 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: Academic Press, New York. MUIRHEAD, R. F. (1903) Some methods applicable to identities and inequalities of symmetric. ... W. Fleming and P. L. Lions, pp. 601-609. Springer-Verlag, New York.
  3. Stability of Flexible Manufacturing Systems

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201994%20Stability%20of%20flexible%20manufacturing%20systems.pdf
    15 Sep 2011: mode k for one period, minus the number of new orders for that item which are received (a number that is independent of k). ... d, where the Alks are nonnegative integers. We can as- sociate with each S' a new manufacturing mode that corresponds to
  4. 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: Received 23 October 1985; revision received 21 April 1986. Postal address: AT & T Bell Laboratories Murray Hill, New Jersey 07974, USA. ... While the methods of earlier sections are adequate to handle the new limit, they are in fact unnecessary; the.
  5. Optimal Control of Service Rates in Networks of Queues

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%20-%20Stidham%201987%20Optimal%20control%20of%20service%20rates%20in%20networks%20of%20queues.pdf
    15 Sep 2011: References. BERTSEKAS, D. (1976) Dynamic Programming and Stochastic Control. Academic Press, New York. ... Adv. Appl. Prob. 15, 616-637. LIPPMAN, S. (1975) Applying a new device in the optimization of exponential queueing systems.
  6. Optimal Call Routing in VoIPCostas Courcoubetis Department of…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kalogiros%20-%202009%20Weber%20Optimal%20call%20routing%20in%20VoIP.pdf
    15 Sep 2011: Besides, new networkingprotocols mitigate traditional quality problems by making iteasier to assign higher priority to real-time traffic. ... III. TRYING ONE GATEWAY AT A TIME. This case occurs if an aggregator hasn’t configured hisproxies to support
  7. 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.pdf
    15 Sep 2011: A new connection of type j would becharged at an amount per unit time proportional to j(s;t). ... their leaky bucket parameters, and(iii) the network recomputes the values of s;t for the new operating point.
  8. LiuWeberZhao11CDC_revised.dvi

    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: 2. One can also generalize the result by allowing new arms.
  9. FA9 - 9:15 Proceedlngs of 25th Conference on Declslon ...

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201986%20A%20bin-packing%20system%20for%20objects%20from%20a%20finite%20set%20necessary%20and%20sufficient%20conditions%20for%20stability%20and%20some%20applications.pdf
    15 Sep 2011: 284, Springer Verlag, Wien, New York. [31 Hoffmann, U. (1982) A class of simple stochastic online bin-packing algorithms, Computing 29, 227-239.
  10. 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: on Theory of Computing, Association for Com-puting Machinery, New York, 1991,230-240. ... 11. 12. 13. 14. 15. 16. of Packing and Partitioning, Wiley& Sons, New York, 1991.
  11. 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: Are there interesting classes for which new perfect packing theoremscan provide us with similar general answers? ... H. Freeman, New York, 1979. [14] D. S. Johnson, Near-Optimal Bin Packing Algorithms, Ph.D.
  12. 1034 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. ...

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202006%20%20Incentives%20for%20large%20peer-to-peer%20systems.pdf
    15 Sep 2011: Thisgreatly reduces the economic value of many new portable de-vices, such as PDAs, tablet computers, and smart-phones run-ning the IP protocol. ... Similar properties hold for the more generalcase of. An interesting issue is how stability is affected by
  13. 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: When either P1 or P2 finishes, S, assigns a new job to the processor just finished and then proceeds optimally. ... Minimizing expected makespans on uniform processor systems 201. In a more mathematical vein, it is apparent from the content of this paper
  14. Scheduling Jobs with Stochastic Processing Requirements on Parallel…

    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: 6, 305-312. VARAIYA, P. P. (1972) Notes on Optimization. Van Nostrand Reinhold, New York.
  15. Tripos Questions in Optimization and Control 20 00314 In ...

    www.statslab.cam.ac.uk/~rrw1/mystuff/2000%20Paper%203%20question%2014.pdf
    20 Sep 2011: What. should she do if Q8 is an easy question?The producers of the show are considering a new game in which everything is the same. ... Quoting any theorem necessary to justifyyour answer, show that for a contestant who plays optimally the new game is
  16. journal7.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202001%20Economic%20issues%20in%20shared%20infrastructures.pdf
    31 Oct 2011: New in this paper is our formulation of models for designingoptimal management policies, our analysis that demonstrates theinadequacy of simple sharing policies, and our proposals for somebetter ones. ... It is appropriate whenorganizations may
  17. Buffer Overflow Asymptotics for a Buffer Handling Many Traffic Sources

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201996%20%20Buffer%20overflow%20asymptotics%20for%20a%20switch%20handling%20many%20traffic%20sources.pdf
    15 Sep 2011: confidence interval for the estimator requires time of the order of magnitude of tens of minutes, which is impractical since decisions about accepting new traffic in the network must be done
  18. 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: the new bin where it is placed isassigned the lexicographically first configuration that includes an item of the givensize. ... Each time such an item arrives, the new bin is assigned the lexicographicallyfirst configuration that includes items of size i.
  19. Discussion of Adaptive confidence intervals for the test error ...

    www.statslab.cam.ac.uk/~rjs57/TestErrorCI.pdf
    11 Mar 2011: 1996) A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York. Fix, E. ... 1974) Differential Topology Prentice-Hall, New Jersey. Hall, P. and Kang, K.-H.
  20. paper3.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Weber%202000%20Measurement%20based%20charging%20in%20communication%20networks.pdf
    15 Sep 2011: What is new is the description of a general framework for a classof charging schemes that can be based on arbitrarily rened a posterior measurements and apriori information (such as that ... In Section 4 wegive a numerical example, which compares a
  21. 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: where it finds space in a partially full bin or starts a new bin. ... The argument for bins that start. with items smaller than k 1’2 must confront distinctly new.
  22. 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.
  23. 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.
  24. 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.
  25. 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
  26. 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.
  27. 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
  28. 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.
  29. 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
  30. 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.
  31. 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.
  32. Observations on the Bomber Problem Richard Weber† Third International …

    www.statslab.cam.ac.uk/~rrw1/talks/Stanford_bomber_seminar.pdf
    8 Jun 2011: Academic Press, New York. Mastran DV, Thomas CJ (1973) Decision rules for attacking targets ofopportunity.
  33. visa06f-courcoubetis.dvi

    www.statslab.cam.ac.uk/~rrw1/research/visa09.pdf
    20 Jan 2011: How should the costsbe shared? How should the new virtual facility be sharedamong its contributors? ... Rey,A. Simon, C. Fernandez, D. Kant, and K. M. Sephton.Sun grid engine, a new scheduler for EGCEmiddleware.
  34. 21 Paper 3, Section I 9H Markov ChainsLet (Xn)n>0 ...

    www.statslab.cam.ac.uk/~rrw1/markov/MarkovChainTriposQuestions2004-11.pdf
    4 Sep 2011: Define a new transition matrix P̃ by. P̃ij ={. 0 if i = j,(1 Pii)1Pij if i 6= j.
  35. cam-report-final formatted

    www.statslab.cam.ac.uk/~grg/cam-report-final2.pdf
    9 Mar 2011: which takes account of migration, demographic shifts and the accession of new Member States. ... 7. What happens when a new State accedes to the Union during a legislative.

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.