Search

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

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

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