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
1 - 10 of 49 search results for katalk:za33 24 |u:www.statslab.cam.ac.uk where 0 match all words and 49 match some words.

  1. Results that match 1 of 2 words

  2. cam-report-final formatted

    www.statslab.cam.ac.uk/~grg/papers/cam-report-final2.pdf
    9 Mar 2011: 15. Member State Population 5 upwards 6 standard Now. 24 Estonia 1 340 127 7 8 6. ... 24 Estonia 1 340 127 7 8 6. 25 Cyprus 803 147 6 7 6.

  3. The Interchangeability of Tandem Queues with Heterogeneous Customers…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201992%20The%20interchangeability%20of%20tandem%20queues%20with%20heterogeneous%20customers%20and%20dependent%20service%20times.pdf
    15 Sep 2011: Adv. Appl. Prob. 24, 727-737 (1992) Printed in N. Ireland. @ Applied Probability Trust 1992. ... 24, No. 3 (Sep., 1992), pp. 509-759. Front Matter. On Some Exponential Functionals of Brownian Motion [pp.

  4. 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: with respect to xij (θ), Qi(θ), subject to. Qi(θ) 0 , xij (θ) 0 , (24). ... function (23) is a concave function ofthe decision variables, and (24)–(26) define a region that is convex in the decision variables.

  5. 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: Weber [66], Foschini and Salz [24], Ephremides et al.

  6. 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: open question of whether there exist distributionsof thii form for which Best Fit yields linearly-growing waste.The proof of the latter theorem relies on a 24-hour computation,and although ... Similar arguments work for U{9,12} with t = 19 and22 = 814,

  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: Hence, if T is the duration of a trace segment j then the eectivebandwidth aj for a connection whose trac is given by this segment is computedfrom j = 1st log 24

  8. 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: If E sb = k n6 (pnk) ; (4.1)24. then E[WFF (L)] = (pnk).Proof.

  9. 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: BIN PACKING WITH DISCRETE ITEM SIZES, PART I: PERFECTPACKING THEOREMS AND THE AVERAGE CASE BEHAVIOR OF. OPTIMAL PACKINGS. E. G. COFFMAN, JR.†, C. COURCOUBETIS‡, M. R. GAREY, D. S. JOHNSON,P. W. SHOR, R. R. WEBER‖, AND M. YANNAKAKIS. SIAM J.

  10. 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: 24). Theorem 3: When arms are stochastically identical, Whit-. tle index policy is asymptotically optimal in the follow sense:. ... 24, no. 2, pp. 293-305, May 1999. [10] R. R. Weber and G.

  11. 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: V(xsc)Q(x)} u (x,s)- {V(x, s, c)Q(x)}. (24). u,(x,s)p, (x)V'(x,s,c s)Q(x). ... ds i=. Equation (23) is obtained by differentiating (2), and (24) by observing that.

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.