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
11 - 20 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. 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

  3. 21 Paper 3, Section I 9H Markov ChainsLet (Xn)n>0 ...

    www.statslab.cam.ac.uk/~rrw1/markov/MarkovChainTriposQuestions2001-11.pdf
    29 Sep 2011: Part IB, 2010 List of Questions [TURN OVER. 24. Paper 2, Section II. ... 24. Paper 1, Section II. 19H Markov Chains. A gerbil is introduced into a maze at the node labelled 0 in the diagram.

  4. O.dvi

    www.statslab.cam.ac.uk/~rrw1/opt1998/O.pdf
    9 May 2011: D: maximize L(λ) subject to λ Y,. 24. equivalently,. D: maximizeλY. {.

  5. Global uniform risk bounds for wavelet deconvolution estimators

    www.statslab.cam.ac.uk/~nickl/Site/__files/AOS836.pdf
    17 Feb 2011: 36], Delaigle and Gijbels [11], Hesseand Meister [24], Johnstone et al.

  6. State space collapse and diffusion approximation for a network…

    www.statslab.cam.ac.uk/~frank/PAPERS/AAP591.pdf
    30 Nov 2011: For this, we need the following definitions. For each n RI+, define w(n) = (wj (n) : j J), to be given bywj (n) =. iI. Aj ini. μi, j J.(24). We

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

  8. 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 =

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

  10. SEQUENTIAL OPEN-LOOP SCHEDULING STRATEGIES P. Nash, R.R. Weber…

    www.statslab.cam.ac.uk/~rrw1/publications/Nash%20-%20Weber%201982%20Sequential%20open-loop%20scheduling%20strategies.pdf
    18 Sep 2011: Sci. 24, pp. 554-561. Gittins, J.C.: 1976, Bandit processes and dynamic allocation indices, J.

  11. The Move-to-Front Rule for Multiple Lists

    www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20The%20move-to-front%20rule%20for%20multiple%20lists.pdf
    15 Sep 2011: Denote by x' the state which is obtained. 24 C. Courcoubetis and R.

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.