Search
Search Funnelback University
- Refined by:
- Date: 2011
31 -
40 of
49
search results for katalk:za33 24 |u:www.statslab.cam.ac.uk
where 0
match all words and 49
match some words.
Results that match 1 of 2 words
-
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.pdf31 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. -
3954
www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%202002%20Perfect%20packing%20theorems%20and%20the%20average%20case%20behavior%20of%20optimal%20and%20online%20bin%20packing.pdf15 Sep 2011: E[w(t]) (u2n1/2/8)[nu/8 nu/24] = u3n1/2/96. This implies. E. [1n. n. t=1. ... w(t). ] u3n1/2/192. On the other hand, ifn1s=0 P(υ(s) n1/2) nu/24, then. -
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.pdf15 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. -
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.pdf18 Sep 2011: 1 (3.24) Cl(a, k 1)= C(a 3, k - 1). 1+ Y2. ... 1 Y2 3. Comparison of (3.24) and (3.25) yields C2(a, k 1) < Cl(a,. -
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.pdf16 Sep 2011: Appl. Prob., 24 (1987) (to appear). [5J L. LOVASZ, Submodular functions and convexity, lvIathematical Programming, the State of the Art, eds A. -
paper3.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Weber%202000%20Measurement%20based%20charging%20in%20communication%20networks.pdf15 Sep 2011: the charging function takes theform a1[: : : ]T1 a2[: : : ]T2 a3[: : : ]V1 a4[: : : ]V2: (24)Recall that T1 and T2 are the total durations of intervals of types I and II respectively; -
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.pdf15 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, -
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.pdf15 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. -
On the Optimality of LEPT and c Rules for Machines in Parallel
www.statslab.cam.ac.uk/~rrw1/publications/Chang%20...%20Weber%201992%20On%20the%20optimality%20of%20LEPT%20and%20cu%20rules%20for%20machines%20in%20parallel.pdf15 Sep 2011: Prob. 24(3). CHANG, C. S. AND YAO, D. D. (1990) Rearrangement, majorization and stochastic scheduling. ... machines. J. Appl. Prob. 24, 430-448. KAMPKE, T. (1989) Optimal scheduling of jobs with exponential service times on identical parallel. -
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.pdf15 Sep 2011: It is usually assumed that a holding cost is charged. Received 24 June 1983; revision received 19 November 1985.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.