Search

10 Oct 2011: The previous result shows that minb=1,.,B ‖Z0 cZb‖ is of order Op(B1/q) as B. ... nj=1. (W (2)nj 1)2 = Op(n1). by (W.1-2), so V̄n p 1.Case 3: Vni = W 2ni.

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.

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: 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.

17 Feb 2011: The Annals of Statistics2011, Vol. 39, No. 1, 201–231DOI: 10.1214/10-AOS836 Institute of Mathematical Statistics, 2011. GLOBAL UNIFORM RISK BOUNDS FOR WAVELETDECONVOLUTION ESTIMATORS. BY KARIM LOUNICI AND RICHARD NICKL. University of Cambridge. We

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

30 Nov 2011: The Annals of Applied Probability2009, Vol. 19, No. 5, 1719–1780DOI: 10.1214/08-AAP591 Institute of Mathematical Statistics, 2009. STATE SPACE COLLAPSE AND DIFFUSION APPROXIMATIONFOR A NETWORK OPERATING UNDER A FAIR BANDWIDTH. SHARING POLICY. BY

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: to test whether the system can op- erated in a manner that keeps expected inventory levels uniformly bounded through time.

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.

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.