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
51 - 60 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.

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.