Results 31 to 40 of about 33,611 (226)

Heavy-traffic limits for many-server queues with service interruptions [PDF]

open access: yesQueueing Systems, 2009
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus- tomer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length process, where the limit is an ordinary differential equation in a two-state random environment ...
Pang, Guodong, Whitt, Ward
openaire   +3 more sources

Load Balancing in the Non-Degenerate Slowdown Regime [PDF]

open access: yes, 2018
We analyse Join-the-Shortest-Queue in a contemporary scaling regime known as the Non-Degenerate Slowdown regime. Join-the-Shortest-Queue (JSQ) is a classical load balancing policy for queueing systems with multiple parallel servers.
Gupta, Varun, Walton, Neil
core   +2 more sources

Faster and Durable: A Cell‐to‐System Validation of a Low‐Degradation Fast‐Charge Protocol for Li‐Ion Batteries

open access: yesAdvanced Science, EarlyView.
A physics‐based framework resolving graphite phase‐separation dynamics establishes a predictive, degradation‐aware fast‐charging methodology for commercial Li‐ion batteries. The resulting model‐informed protocol achieves 20%–80% state‐of‐charge in 14 min while matching the long‐term degradation of a commercial 25‐minute EV strategy.
Marco Lagnoni   +10 more
wiley   +1 more source

Perfect Simulation of $M/G/c$ Queues [PDF]

open access: yes, 2015
In this paper we describe a perfect simulation algorithm for the stable $M/G/c$ queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue.
Connor, Stephen B., Kendall, Wilfrid S.
core   +2 more sources

Ergodicity of an SPDE associated with a many-server queue [PDF]

open access: yesThe Annals of Applied Probability, 2019
We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a First-Come-First-Serve manner.
Aghajani, Reza, Ramanan, Kavita
openaire   +3 more sources

Is Youth's Engagement in Agribusiness an Opportunity or a Necessity? A Closer Look at the Situation in South Kivu, Eastern Democratic Republic of the Congo

open access: yesAgribusiness, EarlyView.
ABSTRACT Despite the broad focus on necessity‐ and opportunity‐driven entrepreneurship in research and policy, the entrepreneurial dichotomy within the agribusiness context has not been adequately addressed. This study contributes to closing this knowledge gap by examining youth's perceptions of agribusiness through the lens of the push‐pull motivation
Cool Dady Mangole   +6 more
wiley   +1 more source

Martingale proofs of many-server heavy-traffic limits for Markovian queues

open access: yes, 2007
This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an elementary model -
Pang, Guodong   +2 more
core   +2 more sources

An infinite dimensional model for a many server priority queue [PDF]

open access: yes2017 51st Annual Conference on Information Sciences and Systems (CISS), 2017
6 pages.
Master, Neal   +2 more
openaire   +2 more sources

Exploring Quantum Support Vector Regression for Predicting Hydrogen Storage Capacity of Nanoporous Materials

open access: yesAdvanced Intelligent Discovery, EarlyView.
In this study we employed support vector regressor and quantum support vector regressor to predict the hydrogen storage capacity of metal–organic frameworks using structural and physicochemical descriptors. This study presents a comparative analysis of classical support vector regression (SVR) and quantum support vector regression (QSVR) in predicting ...
Chandra Chowdhury
wiley   +1 more source

Asymptotic approximations for stationary distributions of many-server queues with abandonment

open access: yes, 2012
A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables.
Kang, Weining, Ramanan, Kavita
core   +1 more source

Home - About - Disclaimer - Privacy