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:za31 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. Observations on the Bomber Problem Richard Weber† Third International …

    www.statslab.cam.ac.uk/~rrw1/talks/Stanford_bomber_seminar.pdf
    8 Jun 2011: y(32,3) = arg maxy[0,5.24]. [. c(y)F(31.4 y,2)]. = 14.0079. y(33,3) = arg maxy[0,5.25]. [. ... 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25}.

  3. createdbydvipdf

    www.statslab.cam.ac.uk/~rrw1/research/K3%20revised.pdf
    17 Oct 2011: 24). This is nearly the dual of (23). With (24) in mind, we imagined taking y to the the AW strategy and worked at trying to guess a fullbasis in the

  4. bomber12.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/weber-bomber_paper_draft4.pdf
    21 Oct 2011: We find, incontradiction to (B),. y(32,3) = arg maxy[0,5.24]. [. c(y)F(31.4 y,2)]. = ... 14,14,14,14,14,14,15,15,15,16,17,18,19,20,21,22,23,24,25}. {k(n,3)}40n=1 =

  5. On a conjecture about assigning jobs to processors of differing…

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201993%20On%20a%20conjecture%20about%20assigning%20jobs%20to%20processors%20of%20different%20speeds.pdf
    15 Sep 2011: Contr. Optimiz., vol. 24, pp. 152-156, 1986. R. Datko, “Not all feedback stabilized hyperbolic systems are robust with respect to small time delays in their feedbacks,” SIAM J.

  6. 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.

  7. 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: Appl. Prob., 24 (1987) (to appear). [5J L. LOVASZ, Submodular functions and convexity, lvIathematical Programming, the State of the Art, eds A.

  8. A Note on Waiting Times in Single Server Queues

    www.statslab.cam.ac.uk/~rrw1/publications/Weber%201983%20A%20note%20on%20waiting%20times%20in%20single%20server%20queues.pdf
    15 Sep 2011: respectively. Using computer simulation, we have estimated the mean waiting times to be 6.614, 6.531 and 6.445 when ju equals 1.24, 1.25 and 1.26, respectively. ... As ju increases from 1.24 to 1.25 to 1.26 the mean waiting time decreases by 0.0830 and

  9. 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.

  10. 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: It is usually assumed that a holding cost is charged. Received 24 June 1983; revision received 19 November 1985.

  11. THE THEORY OF OPTIMAL STOPPING RICHARD Re WEBER DOWNING ...

    www.statslab.cam.ac.uk/~rrw1/publications/The%20theory%20of%20optimal%20stopping%20(Part%20III%20essay).pdf
    21 Oct 2011: 16. 17. 21. 24. 24. 27. 29. 34. 1. Chapter 1. ... t = min{ n : 1tne [0,] u ['ii, 1] }. 24. Chapter 4. The 0Ilt:lmal Stopptng of Random Sequences. Having characterized che solution to the optimal stopping.

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.