págs. 1625-1647
Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates
Jinling Wang, Zhongbin Wang, Yunan Liu
págs. 1648-1667
Technical Note—On the Optimality of Reflection Control
Jiankui Yang, David D. Yao, Heng-Qing Ye
págs. 1668-1677
Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds
Daniel R. Jiang, Lina Al-Kanj, Warren B. Powell
págs. 1678-1697
Information and Memory in Dynamic Resource Allocation
Kuang Xu, Yuan Zhong
págs. 1698-1715
Thomas Kleinert, Martine Labbé , Frank Plein, Martin Schmidt
págs. 1716-1721
Diffusion in Random Networks: Impact of Degree Distribution
Vahideh Manshadi, Sidhant Misra, Scott Rodilitz
págs. 1722-1741
Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization
Jinlong Lei, Uday V. Shanbhag
págs. 1742-1766
Network-Based Approximate Linear Programming for Discrete Optimization
Selvaprabu Nadarajah, Andre A Cire
págs. 1767-1786
Will Ma, David Simchi-Levi
págs. 1787-1803
Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls
Yuqian Xu, Lingjiong Zhu, Michael Pinedo
págs. 1804-1825
Efficient Solution of Maximum-Entropy Sampling Problems
Kurt M. Anstreicher
págs. 1826-1835
págs. 1836-1849
Parallel Bayesian Global Optimization of Expensive Functions
Jialei Wang, Scott C. Clark, Eric Liu, Peter I Frazier
págs. 1850-1865
Why Is Maximum Clique Often Easy in Practice?
Jose L. Walteros, Austin Buchanan
págs. 1866-1895
Maximum Likelihood Estimation by Monte Carlo Simulation: Toward Data-Driven Stochastic Modeling
Yijie Peng, Michael C. Fu, Bernd Heidergott, Henry Lam
págs. 1896-1912
On the Consistent Path Problem
Leonardo Lozano, David Bergman, J. Cole Smith
págs. 1913-1931
© 2008-2025 Fundación Dialnet · Todos los derechos reservados