Search
Search Funnelback University
31 -
40 of
2,148
search results for tj KaKaotalk:PC53
where 0
match all words and 2,148
match some words.
Results that match 1 of 2 words
-
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: Corollary 3.6 (minimization of the expected weighted sum ofjob tardinesses). The tardiness of job j, Tj, is defined as max(Zj - Dj, 0). ... Suppose (A 1) and (A 4) hold, and D, : D2 _? 5 D, a.s. Then n minimizes E[ I=1 cj Tj]. Proof. -
19 Paper 2, Section I 3F ProbabilityLet U be ...
www.statslab.cam.ac.uk/~rrw1/prob/ProbabilityTriposQuestions.pdf17 Sep 2015: Find the probability-generating functions of the random variables Hj and Tj. -
Mathematics of Operational Research Contents Table of Contents i ...
www.statslab.cam.ac.uk/~rrw1/mor/morweber.pdf15 Mar 2016: Mathematics of Operational Research. Contents. Table of Contents i. Schedules v. 1 Lagrangian Methods 11.1 Lagrangian methods. 11.2 The Lagrange dual. 31.3 Supporting hyperplanes. 3. 2 Convex and Linear Optimization 62.1 Convexity and strong duality. -
Mathematics of Operational Research Example Sheet 2 R. Weber ...
www.statslab.cam.ac.uk/~rrw1/mor/examples2.pdf2 Dec 2015: maximizesi,tj. { i. si j. tj : αiβj si tj 0, i, j}. -
8 8 1/2 1/2 1/2 1/2 1 1/2 1/4 ...
www.statslab.cam.ac.uk/~rrw1/markov/slides.pdf14 Nov 2011: 25. . Theorem 5.8. Suppose P is irreducible and recurrent.Then for all j I we have P(Tj < ) = 1. -
21 Paper 4, Section I 9H Markov ChainsLet X0, ...
www.statslab.cam.ac.uk/~rrw1/markov/MarkovChainTriposQuestions.pdf17 Sep 2015: Assume p > q. Let Tj = inf{n > 1 : Xn = j} if this is finite, and Tj = otherwise. ... Let Ti = inf{n > 1 : Xn = i}. For each i 6= j letqij = P(Tj < Ti | X0 = i) and mij = E(Tj | X0 = i). -
Markov Chains These notes contain material prepared by colleagues ...
www.statslab.cam.ac.uk/~rrw1/markov/M.pdf22 May 2013: Pj(Tj < ) Pj(Hi < )Pi(Hj < ) = 1. 5.5 Relation with closed classes. ... P(X0 = i)Pi(Tj < ). so it suffices to show that Pi(Tj < ) = 1 for all i I. -
Asymptotics and optimal bandwidth selection for highest density…
www.statslab.cam.ac.uk/~rjs57/Samworth10.pdf21 Apr 2010: tn, tj tn], where D4 = 12 μ2(K)f ′′(xj ) D1;. • ... tn = o(n1/6).Then. P(f̂h(x. tj ) < f̂h,τ. ) ( tf ′(xj ) D4n1/2h5/2{R(K)fτ 2D3,j D2}1/2). -
CHOICE OF NEIGHBOUR ORDER FOR NEAREST-NEIGHBOUR CLASSIFICATION RULE…
www.statslab.cam.ac.uk/~rjs57/HPSLV.pdf28 Aug 2007: 2/d , then, with v defined by. (4.8), and tj = νj1 {ν/k2(ν)}. -
Maximum likelihood estimation of a multidimensional log-concave…
www.statslab.cam.ac.uk/~rjs57/CSSFinalLV.pdf24 Mar 2010: Maximum likelihood estimation of a multidimensional log-concave density. Madeleine Cule and Richard Samworth†University of Cambridge, UK. and Michael StewartUniversity of Sydney, Australia. Summary. Let X1,. , Xn be independent and identically
Refine your results
Date
- 875 Past year
- 814 Past 6 months
- 808 2024
- 797 Past 3 months
- 635 Past month
- 624 Past fortnight
- 619 Past week
- 486 Yesterday
- 392 Uncertain
- 104 2023
- 94 2019
- 80 2018
- 73 Today
- 72 2016
- 55 2022
- 53 2011
- 51 2005
- 44 2014
- 40 2010
- 39 2015
- 38 2020
- 37 2012
- 35 2017
- 34 2021
- 32 2006
- 27 2013
- 24 2008
- 21 2009
- 19 2007
- 14 2004
- 13 2001
- 9 2002
- 8 2003
- 4 2000
- 1 1999
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.