Search

23 Nov 2011: Good general introduction, especially for those completely new to time series.

31 Oct 2011: Since then there has been a remarkable flowering of new insights, generalizations and applications, to which Glazebrook and Weber have made major contributions. ... This new edition will be an important resource for others wishing to use this approach.

20 Sep 2011: new variants. ... Algorithm SS also depends on a new linear-programming-based pseudopolynomial-time algorithm for solving the NP-hard problem of determining, given a discrete distribution F, just what is the growth

20 Sep 2011: Abstract. This paper reports on experiments with a new on-line heuristic for one-dimensional bin packing whose average-case behavior is surprisingly robust. ... It is known from [7] that for any such distribution the optimal expected waste grows either

20 Sep 2011: This new approach is based on the notion of sequential open-loop control, sometimes used in control engineering to solve stochastic control problems by deterministic means, and is not base don

20 Sep 2011: Each switch estimates the additional fraction of cells that would be lost if new calls were routed through the switch.

29 Sep 2011: Define a new transition matrix P̃ by. P̃ij ={. 0 if i = j,(1 Pii)1Pij if i 6= j.

25 Oct 2011: 1.6] gave a new. proof of this fact. More precisely, they proved (1.5) where (Vi)i0 were taken to be indicator func-. ... rearrangements of the convolution kernels (pi)i1. Instead, we will develop a new approach to prove.

15 Sep 2011: Generalized Semi-Markov Decision Processes [pp.618-630]. New Results in the Theory of Repeated Orders Queueing Systems [pp.631-640]. ... Corrections: Poisson Mixtures and Quasi-Infinite Divisibility of Distributions [p.696]. Corrections: A New Look at

9 Mar 2011: which takes account of migration, demographic shifts and the accession of new Member States. ... 7. What happens when a new State accedes to the Union during a legislative.

20 Sep 2011: Springer-Verlag, New York, 1988. Abstract. We consider a scheduling problem in which $n$ jobs are to be scheduled on $m$ identical processors which operate in parallel.

9 May 2011: leaves the basis. 3. Pivot on the element aij. (i.e., get the equations into the appropriate formfor the new basic solution.). ... Check that repeating these instructions on the new tableau, by pivoting on a12,.

21 Oct 2011: Academic Press, New York. Samuel E (1970)[S] On some problems in operations research. ... The following proof is new. It is for all our models: both fighter and bomber problems.

17 Feb 2011: To the best of our knowledge, the minimax lower bounds derived in thisarticle are also new. ... We suggest a new approach to nonparametric confidence bands based onRademacher symmetrization, in a similar vein as in recent work of Koltchinskii[29].

15 Sep 2011: W. H. Fleming and L. G. Gorostiza, Lecture Notes in Control and Information Sciences 42, Springer-Verlag, New York, 326-343. ... VARAIYA, P. (1972) Notes on Optimization. Van Nostrand Reinhold, New York.

18 Sep 2011: This new alloca tion is pu t into effect during the next review period, and so on. ... J. Sys. Sci. 10, pp. 693-700. Aoki, M.,: 1967, "Optimization of Stochastic Systems", Academic Press, New York.

15 Sep 2011: His paper has inspired me to contributesome new results, which I will report in three parts.

15 Sep 2011: 151-173. 6. LUCE, R. D. AND RAIFFA, H., Games and Decisions, Wiley, New York, 1957. ... Comments on a Queueing Inequality [pp. 956 - 959]. New Books.

15 Sep 2011: Murray Hill, New Jersey 07974. RICHARD R. WEBER. Cambridge University Engineering DepartmentManagement Studies Group. ... The new cost structure is onein which a cost of [1 pj/(pj pj)] is paid whenever / is replaced at the frontof a list which includes j.

20 Sep 2011: The O(n{2=3}) upper bound for the continuous model is new and solves a problem posed a decade ago.