Search

8 Oct 2009: Writing the plane wavefunction φ(r, t) = Aei(prEt)/!, where A is a constant, we can recover theenergy-momentum invariant by adding a constant mass term to the wave

2 Apr 2015: Default value is 0.01eV. 5.4.3 real(kind=dp) :: scissor op. Value of the scissor operator.

27 Jul 2019: INVERSE PROTEIN FOLDING. HIERARCHICAL OPTIMISATION. AND TIE KNOTS. Thomas M A Fink. st johns college. university of cambridge. a dissertation. submitted for the degree. of doctor of philosophy at the. university of cambridge. T O M Y M O T H E R.

13 Feb 2019: B. Littlewood and P. Eastham, inProceedings of the NATO Advanced Research Workshop “Op-tical Properties of Semiconductor Nanostructures”, NATO Sci-ences High Technology Series, Kluwer, 2000.

5 Feb 2019: Linear-scaling methods in ab initio. quantum-mechanical calculations. A dissertation submitted for the degree of. Doctor of Philosophy. at the University of Cambridge. Peter David Haynes. Christ's College, Cambridge. July 1998. Preface. This

5 Feb 2019: QUANTUM MONTE CARLO. CALCULATIONS OF. ELECTRONIC EXCITATIONS. By. Andrew James Williamson. Robinson College, Cambridge. Theory of Condensed Matter Group. Cavendish Laboratory. Madingley Road. Cambridge. CB3 0HE. A dissertation submitted for the.

7 Feb 2013: high speed low speed. P(y | x, 0) = ǫP(y | x, 1) , y 6= x.

20 Jan 2011: In this paper welook at a number of models, making different assumptionsabout the parameters that can be measured, and obtain op-timal policies for each model. ... Thus, a sharing policy which simply op-timizes the efficiency of the system for a given

21 Oct 2011: Thereby it; is hoped to. make clear the way in l'Thich inliui tion might gui:le to deveJ.op.

18 Sep 2011: but now the expression for fI(j. i-I) is. MOll%lle Op/ill/al Policies for Lefr-Skip-Free Markov Decisioll Processes /')1).

31 Oct 2011: H. Ahmad, M. Liu, T. Javadi, Q. Zhao and B. Krishnamachari, “Op-timality of Myopic Sensing in Multi-Channel Opportunistic Access,”IEEE Trans.

15 Sep 2011: In this paper welook at a number of models, making different assumptionsabout the parameters that can be measured, and obtain op-timal policies for each model. ... Thus, a sharing policy which simply op-timizes the efficiency of the system for a given

15 Sep 2011: Appendix I contains a derivation of the op-timization problem of maximizing expected social welfare,and Appendix II justifies the fact that it can be solve usingLagrangian methods. ... APPENDIX IIJUSTIFICATION FOR USE OF LAGRANGIAN METHODS. We prove that

15 Sep 2011: to test whether the system can op- erated in a manner that keeps expected inventory levels uniformly bounded through time.

15 Sep 2011: However,in the following section we discuss variations of the problem in which the op-timal policy does indeed lie within the class of partition policies.

15 Sep 2011: The network op-erator posts taris that have been computed for the current operating point ofthe link, which corresponds to some values of the parameters s;t.

15 Sep 2011: Optimal Call Routing in VoIPCostas Courcoubetis. Department of Computer ScienceAthens University. of Economics and Business47A Evelpidon StrAthens 11363, GR. Email: courcou@aueb.gr. Costas KalogirosDepartment of Computer Science. Athens Universityof

18 Sep 2011: Minimizing expected makespans on uniform processor systems 193. Remark. Clearly, the thresholds too= to, =0 and t1o = t(r)I define an op- timal threshold rule.

23 Apr 1997: From: Stephen Gale. Newsgroups: sci.op-research. Subject: Re: SIMPLEX code for PC.

24 Apr 2005: "! # $%& $. '(),.-/10325468739:-;=<4>/@?A+. BDCFEHGHI6JLKNM%OPGHQRQTSAUVSXWVJ6YZBDC@W[C]M_C],WVQba8WdcbGVe]W[C]GVe_fg J6ThiSjekMklCmf GVnoOpWVq c6ekRYUHS. r Y6RMsM_SjesC@W[C]GHJtMkuc5qvTCsCkS,YwnxGVepC]ISYSjUHesSjSGVn.yzG{1C]GVe|GVn}I6RQGHMsGV5IDf! "