搜索结果: 1-8 共查到“管理科学与工程 Efficient”相关记录8条 . 查询时间(0.729 秒)
Efficient Convex Optimization for Engineering Design
Optimization numerical methods linear programming robust control convex programming interior-point methods
2015/7/13
Many problems in engineering analysis and design can be cast as convex optimization problems, often nonlinear and nondifferentiable. We give a high-level description of recently developed interior-poi...
Efficient Nonlinear Optimization of Queueing Systems
Efficient Nonlinear Optimization Queueing Systems
2015/7/10
We present a systematic treatment of efficient nonlinear optimization of queuing systems. The suite of formulations uses the computational tool of convex optimization, with fast polynomial time algori...
We consider the problem of choosing the gate sizes or scale factors in a combinational logic circuit in order to minimize the total area, subject to simple RC timing constraints, and a minimum allowed...
Efficient Monte Carlo Simulation of Security Prices
Efficient Monte Carlo Simulation Security Prices
2015/7/8
This paper provides an asymptotically efficient algorithm for the allocation of computing resources to the problem of Monte Carlo integration of continuous-time security prices. The tradeoff between i...
Much of the rare-event simulation literature is concerned with the development of asymptotically optimal algorithms. Because of the difficulties associated with applying these ideas to complex models,...
Fluid Heuristics, Lyapunov Bounds, and Efficient Importance Sampling for a Heavy-tailed G/G/1 Queue
State-dependent importance sampling Rare-event simulation Heavy-tails
2015/7/6
We develop a strongly efficient rare-event simulation algorithm for computing the tail of the steady-state waiting time in a single server queue with regularly varying service times. Our algorithm is ...
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 ...
On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling
Lyapunov Inequalities Efficient Importance Sampling
2015/7/6
In this article we explain some connections between Lyapunov methods and subsolutions of an associated Isaacs equation for the design of efficient importance sampling schemes. As we shall see, subsolu...