We formulate a two-stage stochastic integer program to determine an optimal schedule for jobs requiring multiple classes of resources under uncertain processing times, due dates, resource consumption and availabilities. We allow temporary resource capacity expansion for a penalty. Potential applications of this model include team scheduling problems that arise in service industries such as engi...

Multifidelity approximate Bayesian computation (MF-ABC) is a likelihood-free technique for parameter inference that exploits model approximations to significantly increase the speed of ABC algorithms [T. P. Prescott and R. E. Baker, SIAM/ASA J. Uncertain. Quantif., 8 (2020), pp. 114--138]. Previous work has considered MF-ABC only in context rejection sampling, which does not explore space parti...

In this paper, we study the performance benefits of cell search algorithm. The purpose of the cell search algorithm in UMTS is to estimate the spreading code of the serving base-station and its corresponding timing offset. The search procedure consists of 3 sequential and distinct stages: (1) slot-boundary synchronization, (2) frame-boundary synchronization with code-group identification, and (...

The purpose of the cell search algorithm in UMTS is to estimate the spreading code of the serving base-station and its corresponding timing offset. The search procedure consists of 3 sequential and distinct stages: (1) slot-boundary synchronization, (2) frame-boundary synchronization with code-group identification, and (3) scrambling code identification. Algorithms that have appeared in literat...