搜索结果: 1-8 共查到“管理科学与工程 Maximum”相关记录8条 . 查询时间(0.031 秒)
Maximum likelihood and generalized spatial two-stage least-squares estimators for a spatial-autoregressive model with spatial-autoregressive disturbances
spreg spatial-autoregressive models
2015/9/24
We describe the spreg command, which implements a maximum
likelihood estimator and a generalized spatial two-stage least-squares estimator
for the parameters of a linear cross-sectional spatial-auto...
Computation of the Maximum H_infinity-norm of Parameter-Dependent Linear Systems by a Branch and Bound Algorithm
Computation Maximum H_infinity-norm Parameter-Dependent Linear Systems Bound Algorithm
2015/7/13
For linear systems that contain unspecified parameters that lie in given intervals, we present a branch and bound algorithm for computing the maximum H_infinity-norm over the set of uncertain paramete...
Average Case Behavior of Random Search for the Maximum
Average Case Behavior Random Search Maximum
2015/7/8
This paper is a study of the error in approximating the global maximum of a Brownian motion on the unit interval by observing the value at randomly chosen points. One point of view is to look at the e...
Simulating the Maximum of a Random Walk
Random walk Single-server queue Simulation Stationary distribution
2015/7/8
In this paper, we show how to exactly sample from the distribution of the maximum of a random walk with negative drift. We also explore related variance reduction methods.
Diffusion Approximations for the Maximum of a Perturbed Random Walk
Perturbed random walk diffusion approximation light-tailed distributi
2015/7/6
Considera random walk S=(Sn:n≥O) that is "perturbed" by a stationary sequence (ξn:n≥O) to produce the process S=(Sn+ξn:n≥O). In this paper, we are concerned with developing limit theorems and approxim...
Tail Asymptotics for the Maximum of Perturbed Random Walk
Perturbed random walk Cramér–Lundberg approximation coupling heavy tails
2015/7/6
Consider a random walk S = (Sn:n≥0) that is “perturbed” by a stationary sequence (ξn:n≥0) to produce the process (Sn+ξn:n≥0). This paper is concerned with computing the distribution of the all-time ma...
Complete Corrected Diffusion Approximations for the Maximum of a Random Walk
Corrected diffusion approximations random walks ladder heights single-server queue
2015/7/6
Consider a random walk (Sn: n ≥ 0) with drift −μ and S0= 0. Assuming that the increments have exponential moments, negative mean, and are strongly nonlattice, we provide a complete asymptotic ex...
Efficient Rare-event Simulation for the Maximum of Heavy-tailed Random Walks
State-dependent importance sampling rare-event simulation heavy-tails Lyapunov bounds random walks
2015/7/6
Let (Xn: n ≥ 0) be a sequence of i.i.d. r.v.’s with negative mean. Set S0 = 0 and define Sn = X1 +· · ·+Xn. We propose an importance sampling algorithm to estimate the tail of M = max{Sn: n ≥ 0} that ...