Search
Search Funnelback University
- Refined by:
- Date: 2011
1 -
49 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
-
ADVANCED PROBABILITY 24 lectures This course aims to cover ...
https://www.statslab.cam.ac.uk/~ps422/summary.pdf7 Oct 2011: ADVANCED PROBABILITY 24 lectures. This course aims to cover the advanced topics at the core of research in probability theory. -
Abstract
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c92a.html20 Sep 2011: Prob., 24, 667-681, 1992. Abstract. Items of various types arrive at a bin packing facility according to random processes and are to be combined with other readily available items of -
Cambridge Compromise
https://www.statslab.cam.ac.uk/~grg/afco.pdf17 Feb 2011: 24 / 31. Discussion. Two classes of method. I non-linear functions: parabolic, power,. ... 24 Estonia 1 340 127 7 8 6. 25 Cyprus 803 147 6 7 6. -
Investigation of cell scale and burst scale effects on the cell loss…
https://www.statslab.cam.ac.uk/~rrw1/abstracts/c97a.html20 Sep 2011: Workshop on Performance Engineering of Computer and Telecommunication Systems (UKPEW'97) , Ilkley, U.K., July 24, 1997. -
Brownian motion with variable drift: 0-1 laws, hitting probabilities…
https://www.statslab.cam.ac.uk/~ps422/bmdrift.pdf26 Oct 2011: Proof of Theorem 1.5 (a). From [3, Proposition 1.1] or [12, Theorem 8.24] we have thatfor any transient Brownian motion. ... From [3, Proposition 1.1] or [12, Theorem 8.24] we have that. -
cam-report-final formatted
https://www.statslab.cam.ac.uk/~grg/cam-report-final2.pdf9 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. -
Observations on the Bomber Problem Richard Weber† Third International …
https://www.statslab.cam.ac.uk/~rrw1/talks/Stanford_bomber_seminar.pdf8 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}. -
Symmetric Rearrangements Around Infinity with Applications to Lévy…
https://www.statslab.cam.ac.uk/~ps422/LevyRearrangement.pdf25 Oct 2011: on O}, (1.24). with CqX(O) := if the infimum is taken over an empty set. ... show. that the infimum in (1.24) is achieved at a function eqO D(Eq), called the q-equilibrium potential ofO. -
21 Paper 3, Section I 9H Markov ChainsLet (Xn)n>0 ...
https://www.statslab.cam.ac.uk/~rrw1/markov/MarkovChainTriposQuestions2004-11.pdf4 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. -
cam-report-final formatted
https://www.statslab.cam.ac.uk/~grg/papers/cam-report-final2.pdf9 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. -
createdbydvipdf
https://www.statslab.cam.ac.uk/~rrw1/research/K3%20revised.pdf17 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 -
21 Paper 3, Section I 9H Markov ChainsLet (Xn)n>0 ...
https://www.statslab.cam.ac.uk/~rrw1/markov/MarkovChainTriposQuestions2001-11.pdf29 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. -
O.dvi
https://www.statslab.cam.ac.uk/~rrw1/opt1998/O.pdf9 May 2011: D: maximize L(λ) subject to λ Y,. 24. equivalently,. D: maximizeλY. {. -
Global uniform risk bounds for wavelet deconvolution estimators
https://www.statslab.cam.ac.uk/~nickl/Site/__files/AOS836.pdf17 Feb 2011: 36], Delaigle and Gijbels [11], Hesseand Meister [24], Johnstone et al. -
State space collapse and diffusion approximation for a network…
https://www.statslab.cam.ac.uk/~frank/PAPERS/AAP591.pdf30 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 -
A Note on Waiting Times in Single Server Queues
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201983%20A%20note%20on%20waiting%20times%20in%20single%20server%20queues.pdf15 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 -
bomber12.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/weber-bomber_paper_draft4.pdf21 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 = -
THE THEORY OF OPTIMAL STOPPING RICHARD Re WEBER DOWNING ...
https://www.statslab.cam.ac.uk/~rrw1/publications/The%20theory%20of%20optimal%20stopping%20(Part%20III%20essay).pdf21 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. -
SEQUENTIAL OPEN-LOOP SCHEDULING STRATEGIES P. Nash, R.R. Weber…
https://www.statslab.cam.ac.uk/~rrw1/publications/Nash%20-%20Weber%201982%20Sequential%20open-loop%20scheduling%20strategies.pdf18 Sep 2011: Sci. 24, pp. 554-561. Gittins, J.C.: 1976, Bandit processes and dynamic allocation indices, J. -
The Move-to-Front Rule for Multiple Lists
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20The%20move-to-front%20rule%20for%20multiple%20lists.pdf15 Sep 2011: Denote by x' the state which is obtained. 24 C. Courcoubetis and R. -
journal7.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202001%20Economic%20issues%20in%20shared%20infrastructures.pdf31 Oct 2011: In a problem addressed in [23] and [24]jobs must be allocated to machines which are strategic inrevealing their processing times for the jobs. ... j 6=i pj(θj). Mechanism 3:The allocating rule is as in Mechanism 1.As an application of (24)agent1 pays. -
1034 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. ...
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202006%20%20Incentives%20for%20large%20peer-to-peer%20systems.pdf15 Sep 2011: 24, NO. 5, MAY 2006. Now, consider the solution of. For the uniform distribu-tion, , so our problem is. ... 24, NO. 5, MAY 2006. central authority, a “global planner,” who serves as an interme-diary for implementing these rules. -
On a conjecture about assigning jobs to processors of differing…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201993%20On%20a%20conjecture%20about%20assigning%20jobs%20to%20processors%20of%20different%20speeds.pdf15 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. -
The Rendezvous Problem on Discrete Locations
https://www.statslab.cam.ac.uk/~rrw1/publications/Anderson%20-%20Weber%201990%20The%20rendezvous%20problem%20on%20discrete%20locations.pdf15 Sep 2011: SIAM J. Control. Optim. 24, 66-75. ANANTHARAM, V. AND VARAIYA, P. -
The Interchangeability of Tandem Queues with Heterogeneous Customers…
https://www.statslab.cam.ac.uk/~rrw1/publications/Weber%201992%20The%20interchangeability%20of%20tandem%20queues%20with%20heterogeneous%20customers%20and%20dependent%20service%20times.pdf15 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. -
On the Performance of an E�ective Bandwidths FormulaCostas…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-Weber%201994%20On%20the%20performance%20of%20an%20effective%20bandwidths%20formula.pdf15 Sep 2011: Ei = mi i2B ; (2)2. where i = limn!1(1=n)E 24 nXk=1 Xk!235 : i is commonly called the index of dispersion. -
A Self-Organizing Bin Packing HeuristicJanos Csirik � David S. ...
https://www.statslab.cam.ac.uk/~rrw1/publications/Csirik%20-%20Johnson%20-%20Kenyon%20-%20Shor%20-%20Weber%201999%20A%20self-organizing%20bin%20packing%20heuristic.pdf15 Sep 2011: For now it is interesting. A Self Organizing Bin Packing Heuristic 5Alg n Samples j = 24 25 60 97 98 99SS 105 100 223 223 884 23,350 28,510 ... 118109 3 68,719 187,061 3,512,397BF 105 100 78 167 16,088 22,669 24,736 25,532106 32 76 831 154,460 59,015 -
p2pw6.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Antoniadis%20-%20Courcoubetis%20-%20Weber%202004%20An%20Asymptotically%20Optimal%20Scheme%20for%20P2P%20File%20Sharing.pdf15 Nov 2011: Each of the peers whohas θ = 0.5 makes net benefit of 24.6390. ... Under this mechanism,the peers who have θ = 0.5 will now make a greater netbenefit of 24.6975. -
Concavity and Monotonicity Properties in aGroundwater Management…
https://www.statslab.cam.ac.uk/~rrw1/publications/Huh%20-%20Krishnamurhty-%20Weber%202011%20Concavity%20and%20Monotonicity%20Properties%20in%20a%20Groundwater%20Management%20Model.pdf25 Oct 2011: exploitation of groundwater. Journal of Environmental Economics and Management,. 24(2):139–158, 1993. -
An on-line Estimation Procedure forCell-Loss Probabilities in ATM…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Fouskas%20-%20Weber%201995%20A%20on-line%20estimation%20procedure%20for%20cell-loss%20probabilities.pdf15 Sep 2011: A crude estimate of the variance of the logi estimator is given by2i = 1M 1 8><>: MXj=1(yi;j yi)2 1M 24 MXj=1(yi;j yi)3529>=>; -
LiuWeberZhao11CDC_revised.dvi
https://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
https://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
https://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
https://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…
https://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
https://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…
https://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…
https://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
https://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
https://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. -
Optimal Selection of Stochastic Intervals under a Sum Constraint
https://www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20-%20Flatto-%20Weber%201987%20Optimal%20selection%20of%20stochastic%20intervals%20under%20a%20sum%20constraint.pdf15 Sep 2011: Let. (24) Ei = Pi= F(E,). and for i = 1, 2 define the events. -
P:TEXSIDMA�-3Õ93Õ93
https://www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%202000%20Bin%20packing%20with%20discrete%20item%20sizes,%20Part%20I%20Perfect%20packing%20theorems.pdf15 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. -
MunWebWei06JoS_2.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Mundinger%20-%20Weber%20-%20Weiss%202008%20Optimal%20scheduling%20of%20peer-to-peer%20file%20dissemination.pdf15 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 -
Monotonic and Insensitive Optimal Policies for Control of Queues with …
https://www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201989%20Monotonic%20and%20insensitive%20optimal%20policies%20for%20control%20of%20queues%20with%20undiscounted%20costs.pdf15 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: -
Fundamental Discrepancies Between Average-Case Analyses Under…
https://www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20...%20Weber%201991%20Fundamental%20discrepancies%20between%20average-case%20analyses%20under%20discrete%20and%20continuous%20distributions%20A%20bin%20packing%20case%20study.pdf15 Sep 2011: additional gaps of size 1, for a total of 23 m/24. -
Preprint 0 (2000) 1{22 1Telecommunication Systems, 15(3-4):323-343,…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Siris%20-%20Weber%202000%20A%20study%20of%20simple%20charging%20schemes%20for%20broadband%20networks.pdf15 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 -
A survey of Markov decision models for control of networks of queues
https://www.statslab.cam.ac.uk/~rrw1/publications/Stidham%20-%20Weber%201993%20A%20survey%20of%20Markov%20decision%20models%20for%20control%20of%20networks%20of%20queues.pdf15 Sep 2011: Weber [66], Foschini and Salz [24], Ephremides et al. -
To appear in RANDOM STRUCTURES AND ALGORITHMSBin Packing with ...
https://www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20-%20Johnson%20-%20Shor%20-%20Weber%201996%20Bin%20packing%20with%20discrete%20item%20sizes%20Part%20II.pdf15 Sep 2011: If E sb = k n6 (pnk) ; (4.1)24. then E[WFF (L)] = (pnk).Proof. -
jacm.dvi
https://www.statslab.cam.ac.uk/~rrw1/publications/Csirik%20-%20Johnson%20-%20Kenyon%20-%20Orlin%20-%20Shor%20-%20Weber.2000%20%20On%20the%20sum-of-squares%20algorithm%20for%20bin%20packing.pdf15 Sep 2011: On the Sum-of-Squares Algorithm for Bin Packing. JANOS CSIRIK. University of Szeged, Szeged, Hungary. DAVID S. JOHNSON. AT&T Labs - Research, Florham Park, New Jersey. CLAIRE KENYON. Brown University, Providence, Rhode Island. JAMES B. ORLIN and
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.