Titlebook: Advances in Stochastic Simulation Methods; N. Balakrishnan,V. B. Melas,S. Ermakov Book 2000 Springer Science+Business Media New York 2000

ALIBI

違反

A Comparative Study of MV- and SMV-Optimal Designs for Binary Response Models double exponential models and report on the efficiency changes in both types of designs when the nominal values of the parameters are misspecified..Our results show that while .-optimal designs may appear as a more rational criterion, .-optimal designs can be less sensitive to misspecification in the nominal value of the parameters.

Frequency-Range

CUMB

Selecting from Normal Populations the One with the Largest Absolute Mean: Common Unknown Variance Ca-zone formulation of Bechhofer (.), assuming that the populations have a common known variance. When the common variance is unknown, a single-stage procedure that guarantees a minimum probability of a correct selection does not exist. In this paper, a non-eliminating two-stage procedure is proposed and studied for this situation.

向下五度才偏

https://doi.org/10.1007/978-94-011-2322-8The paper deals with Monte Carlo algorithms for the calculation of the solution of Neumann boundary value problem. Estimators, which have finite variance up to the boundary, are pointed out. The developed estimators are applied to the solution of Navier-Stokes equations by method of vortex simulation.

Glossy

B. L. Davies,A. J. Robotham,A. YarwoodSimple lower and upper bounds on service cycle times in stochastic acyclic fork-join queueing networks are derived using a (max, +)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.

Immortal

薄膜

有抱負者

Monte Carlo Algorithms For Neumann Boundary Value Problem Using Fredholm RepresentationThe paper deals with Monte Carlo algorithms for the calculation of the solution of Neumann boundary value problem. Estimators, which have finite variance up to the boundary, are pointed out. The developed estimators are applied to the solution of Navier-Stokes equations by method of vortex simulation.

擦試不掉

Algebraic Modelling and Performance Evaluation of Acyclic Fork-Join Queueing NetworksSimple lower and upper bounds on service cycle times in stochastic acyclic fork-join queueing networks are derived using a (max, +)-algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.