Search

Search Funnelback University

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

  2. STOCHASTIC SCHEDULING ON PARALLEL PROCESSORS AND MINIMIZATION OF…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201988%20Stochastic%20scheduling%20on%20parallel%20processors%20and%20minimization%20of%20concave%20functions%20of%20completion%20times.pdf
    16 Sep 2011: Consider the new problem vhich is obtained vhen ve decrease Wi to Wi and increase Pi (X i) to Pi( x J in this fashion. ... The total expected. cost in the new problem vill be just )'1/ a tin1es the total expected discounted cost in the original.
  3. Admission control and routing in ATM networks using inferences from…

    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: Therefore there are two calls of the new type currently using the buffer. ... Large Deviations. Academic Press, New York, NY, 1989. Y.C. Ho and C.
  4. Optimization IB1998

    www.statslab.cam.ac.uk/~rrw1/opt/index98.html
    31 Oct 2011: Each lecture begins on a new page. There are individual files for each lecture.
  5. CHAPTER 13 MONOTONE OPTIMAL POLICIES FOR LEFT-SKIP-FREE MARKOV…

    www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201999%20Monotone%20optimal%20policies%20for%20left-skip-free%20Markov%20decision%20processes.pdf
    18 Sep 2011: Chapnlan-l-laIL London, 1995. [5] Lippman, S. A. Applying a new device in the optitnization of exponential queuing systetl1s.
  6. Stochastic Dispatching of Multi-Priority Jobs to Heterogeneous…

    www.statslab.cam.ac.uk/~rrw1/publications/Xu%20-%20Mirchandani%20-%20Kumar%20-%20Weber%201990%20Stochastic%20dispatching%20of%20multi-priority%20jobs%20to%20heterogeneous%20processors.pdf
    15 Sep 2011: Wiley, New York. WEBER, R. R. (1981) Scheduling jobs on parallel machines to minimize makespan or flowtime.
  7. 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: 5. finer asymptotic detail). We are uniquely able to dealwith multiple constraints because of our new method ofestablishing the applicability of Lagrangian methods forthe mechanism design problem, as we explain for
  8. Stable policies for Petri-nets with fluctuating transition processes…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-Weber%201990%20Stable%20policies%20for%20Petri-nets%20with%20fluctuating%20transition%20processes.pdf
    15 Sep 2011: CH2917-3/90/0000-0664$1. OO @ 1990 IEEE 664. Tlie present paper develops some new theory, which for the PN inoclcl allows oiie to make quibe general assumptions about, fluctatioiis of ... We caii associate with each S; a new maii- ufacturiiig mode t h a
  9. Necessary and Sufficient Conditions for Stability of a Bin-Packing…

    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: 284, Springer-Verlag, New York. HOFFMANN, U. (1982) A class of simple stochastic online bin-packing algorithms.
  10. wiopt.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202004%20Asymptotics%20for%20provisioning%20problems%20of%20peering%20wireless%20LANS%20with%20a%20large%20number%20of%20participants.pdf
    15 Sep 2011: This greatly reducesthe economic value of many new portable devices, such as PDAs, tablet computers and smart-phonesrunning the IP protocol. ... Cometa and other large WISPs attempt to set up new WLAN APs inhot spots and create their own standards,
  11. Z:/helmut/Projekte/JUCS_2008/accepted_papers/Soursos/source_files/sour…

    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: New types of contracts emerge(“dynamic contracts”) which allow customers to dynamically adjust their bandwidthdemand. ... The new reaction curve b(a) has three segments, similar to the reaction curveof Section 3.
  12. 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.
  13. 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
  14. 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.
  15. 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.
  16. 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
  17. 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.
  18. 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.
  19. 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.
  20. 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.
  21. 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

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.