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 2,373 search results for katalk:PC53 24 / where 0 match all words and 2,373 match some words.

  1. Results that match 1 of 2 words

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

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

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

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

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

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

  8. Monotonic and Insensitive Optimal Policies for Control of Queues with …

    www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201989%20Monotonic%20and%20insensitive%20optimal%20policies%20for%20control%20of%20queues%20with%20undiscounted%20costs.pdf
    15 Sep 2011: Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted CostsAuthor(s): Shaler Stidham Jr. and Richard R. WeberSource: Operations Research, Vol. 37, No. 4 (Jul. - Aug., 1989), pp. 611-625Published by: INFORMSStable URL:

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

  10. MunWebWei06JoS_2.dvi

    www.statslab.cam.ac.uk/~rrw1/publications/Mundinger%20-%20Weber%20-%20Weiss%202008%20Optimal%20scheduling%20of%20peer-to-peer%20file%20dissemination.pdf
    15 Sep 2011: Optimal Scheduling of Peer-to-Peer File Dissemination. Jochen Mundinger, Richard Weber† and Gideon Weiss‡. Abstract. Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increas-ingly used for disseminating potentially large

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

Refine your results

Format

clear all

Date

Related searches for katalk:PC53 24 /

By site

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.