Search
Search Funnelback University
- Refined by:
- Date: 2011
21 -
30 of
55
search results for tj KaKaotalk:PC53
where 0
match all words and 55
match some words.
Results that match 1 of 2 words
-
DAMTP 2010/NA04 Beyond symmetric Broyden for updating quadratic…
www.damtp.cam.ac.uk/user/na/NA_papers/NA2010_04.pdf13 Apr 2011: F(x) = 12xT{ n. j=1 100(j1)/(n1) vj v. Tj. }x, xRn. -
revision.dvi
www.damtp.cam.ac.uk/user/na/people/Alexei/papers/kmon.pdf1 Sep 2011: f (tj ) = g(tj ) on {a = t0 < t1 <. < tn < tn1 = b}. Then, there exists a spline z such that. ... be such thatg(tj ) = p(tj ) on {a = t0 < t1 <. < tn < tn1 = b}. Then, there exists a spline z such that. -
PART I: Symmetries and particles. NOTES BY PROF. HUGH ...
www.damtp.cam.ac.uk/user/examples/3P2Lb.pdf10 Oct 2011: PART I: Symmetries and particles. NOTES BY PROF. HUGH OSBORN. Books. Books developing group theory by physicists from the perspective of particle physics are. H. F. Jones, Groups, Representations and Physics, 2nd ed., IOP Publishing (1998).A fairly -
PII: 0198-0149(81)90135-7
www.itg.cam.ac.uk/people/heh/Paper41.pdf26 Sep 2011: tJ l,t,R. occupied with the failing conductivity cell and Stas S842 to 8853 with the r c p l a c c m e u resistor. -
Membrane Protein Insertion at the Endoplasmic Reticulum
https://www2.mrc-lmb.cam.ac.uk/groups/hegde/download/75_Shao_S_Ann_Rev_2011.pdf9 Nov 2011: Annu. Rev. Cell Dev. Biol. 2011.27:25-56 -
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: chains Mj,K, t > 1,which have the same state space w MJ,K = (S,K, TJ,K ),but have product matrices J,K for transition functions, i.e.,chains in ... The tint is theta [ 1, an n(,K x. larray of integers,that is used as a sparse representation for the -
Stability of On-Line Bin Packing with Random Arrivals and…
https://www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201990%20Stability%20of%20on-line%20bin%20packing%20with%20random%20arrivals%20and%20long-run%20average%20constraints.pdf15 Sep 2011: lim l-Z"(tJ)cJb=f. (l.Dt—co t j =. The model here is the same as that in Refs. -
EXPLICIT n-DESCENT ON ELLIPTIC CURVESIII. ALGORITHMS J.E. CREMONA,…
https://www.dpmms.cam.ac.uk/~taf1000/papers/n-descent-III.pdf18 Jul 2011: where zi = z(Ti). Alternatively, since. r(Ti, Tj) =. {x ei if i = jy/(x ek) if {i, j, k} = {1, 2, 3},. ... ρ(Ti, Tj) =. {αi if i = jb/αk if {i, j, k} = {1, 2, 3},. -
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: Now. Z7ji, i- 1) =tj(i, i - )c(y) hj(i, i - 1). ... 1, O)]/[tj(1, 0) X-'] < oo.). -
spn0.dvi
www.damtp.cam.ac.uk/user/na/people/Alexei/papers/spn0.pdf1 Sep 2011: The subintervals of and their lengthes will be denoted by. Ij := (tj, tj1), |hj| := tj1 tj. ... Nj = 1, (1.1.1). Mj (x) =k. tjk tjNj(x),. tjk. tj.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.