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
31 - 40 of 58 search results for TALK:PC53 20 |u:www.statslab.cam.ac.uk where 0 match all words and 58 match some words.

  1. Results that match 1 of 2 words

  2. journal7.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202001%20Economic%20issues%20in%20shared%20infrastructures.pdf
    31 Oct 2011: Case (i) is common whenthe infrastructure is initially created using public funding, and(ii) is common in large e-science projects, e.g., [17], [18],[19], [20], and in other virtual ... L = Eθ. {. i. x. [. (1 λ)ui(x|θi). λ1Fi(θi)fi(θi)θiui(x|θi).

  3. 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: 0 1 2 3 4 5 6. 0.05. 0.10. 0.15. 0.20. ... Acknowledgement. This research project is co-financed by E.U.-European So-cial Fund (80%) and the Greek Ministry of Development-GSRT (20%).

  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: From (19) and (20). (29) P(Di n D2) = O(exp (-n n)). ... R. WEBER. 09 ---)=20. 08-. 07. 06. 09 0 t0 20 30 40 50.

  5. Stability of On-Line Bin Packing with Random Arrivals and…

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20Stability%20of%20on-line%20bin%20packing%20with%20random%20arrivals%20and%20long-run%20average%20constraints.pdf
    15 Sep 2011: 3 , a , c J • • • ( J m a m c ; / 3 m 1 a m 1 c am 1 = 0, (2.20). ... 1 in (2.20) must be of equal sign, contradict-ing the assumption we made earlier.

  6. 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: 20 -20 l o 1. QT = [ -lo The number of sources, N , was varied. ... for Fa and (20,15,5) for Fb for both small and large-time simulations.

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

    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: A Self Organizing Bin Packing Heuristic 9. h. j. 0 10 20 30 40 50. ... 0. 20. 40. 60. 80. 100. -----------------------------------------------------------------. --------------------------------------------------------------. -----------------------------

  8. 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: The inductive step for (16) comes from (20), using the fact that for an sc2 density,. ... 10-19]. The Saddlepoint Approximation for a General Birth Process [pp. 20-28].

  9. 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: i'"ol1o(ol1e Optinzal Policies for Leji-Skip-F1'ee Alarkov Decision Processes 20! 10 siTnplify thcse expressions, assume (without loss of gencrality) that the tiTllC unit has been chosen so

  10. bc98_crc_with_ref.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Siris%20-%20Weber%201998%20A%20Study%20of%20simple%20usage-based%20charging%20schemes%20for%20broadband%20networks.pdf
    15 Sep 2011: peak/mean boundsimple bound. inverted T. (a) B = 0:25 106 bytes 00.10.20.30.4. ... 0020.00300.20.4.

  11. 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: 3.20) C2(a, k) = C( Ey, k - 1) = E(k - E1 E). ... inequality holding if (El, k) is strongly stable. Clearly, (3.19), (3.20) and (3.22) jointly imply that C(a, k) = Cl(a, k) = E(k 1,.

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.