Results 291 to 300 of about 22,809,596 (368)
A Novel Traffic Scheduling Algorithm for Multi-CQF Using Mixed Integer Programming and Variable Neighborhood Search Genetic Algorithm in Time-Sensitive Networking. [PDF]
Wang C, Lin Z, Zhao Y, Hu F, Huan Z.
europepmc +1 more source
Real-time monitoring system for early stroke detection based on fog computing and enhanced deep learning techniques. [PDF]
Mohamed AM +4 more
europepmc +1 more source
TCP BBR-n interplay with modern AQM in Wireless-N/AC networks: Quest for the golden pair. [PDF]
Ahsan M, Muhammad SS.
europepmc +1 more source
Optimizing patient flow logistics: strategic challenges, tactical solutions, and future directions. [PDF]
Zamani H, Parvaresh F, Isfahani MN.
europepmc +1 more source
Outpatient Process Transformation and Patient Satisfaction Under New Public Service Theory. [PDF]
Cai Z, Wu A, Wang X, Xie H.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Operational Research, 2021
Now all three of the 742 lecturers (in 2001 at least) have a background in Physics, and Physics is largely about finding mathematical models or descriptions of some physical system or process.
Peter Fenwick
semanticscholar +1 more source
Now all three of the 742 lecturers (in 2001 at least) have a background in Physics, and Physics is largely about finding mathematical models or descriptions of some physical system or process.
Peter Fenwick
semanticscholar +1 more source
Queue-dependent servers queueing system
Microelectronics Reliability, 1993Abstract A Markovian queue with number of servers depending upon queue length is discussed. The system starts another server whenever the queue length in front of first server reaches a certain length N. Associating the costs with the opening of a new server and the waiting of the customers, a relationship is developed to obtain the optimum value of ...
R.L. Garg, Paramjit Singh
openaire +1 more source
Queueing System with Independent Queues and Common Server
IFAC Proceedings Volumes, 1986Abstract An approach is suggested for solving the problem of defining the length of several independent queues in the queueing system (QS) with one server. The initial QS is subjected to decomposition into two separate QS· For each of them analytical solutions are obtained, and for the second QS they are based upon embedded Markov chains. The general
E.M. Mamedli +2 more
openaire +1 more source
Queueing Syst. Theory Appl., 2011
We consider a heterogeneous queueing system consisting of one large pool of O(r) identical servers, where r→∞ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in the distributional sense.
D. Gamarnik, A. Stolyar
semanticscholar +1 more source
We consider a heterogeneous queueing system consisting of one large pool of O(r) identical servers, where r→∞ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in the distributional sense.
D. Gamarnik, A. Stolyar
semanticscholar +1 more source
1987
The input (σn, τn, n ∈ Z/) is defined as in §1.1. The system has an infinite reservoir of servers, so that any customer is immediately attended. Therefore, customer n arriving at time Tn leaves at time Tn + σn (service is provided at unit rate).
François Baccelli, Pierre Brémaud
openaire +1 more source
The input (σn, τn, n ∈ Z/) is defined as in §1.1. The system has an infinite reservoir of servers, so that any customer is immediately attended. Therefore, customer n arriving at time Tn leaves at time Tn + σn (service is provided at unit rate).
François Baccelli, Pierre Brémaud
openaire +1 more source

