Results 231 to 240 of about 594,417 (290)
Cost-Aware Scheduling Under Latency Constraints for Multi-View 3D Reconstruction Across the Edge-Cloud Continuum. [PDF]
Sensors (Basel)Čilić I +3 more
europepmc +1 more source
Cloud-Edge Resource Scheduling and Offloading Optimization Based on Deep Reinforcement Learning. [PDF]
Sensors (Basel)Yin L, Xie Y, Zhao Z, Gao J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Admission control with batch arrivals
Operations Research Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Lerzan Örmeci, Apostolos Burnetas
openaire +2 more sources
Ergodicity of a Jackson network by batch arrivals
Journal of Applied Probability, 1994The Jackson network under study receives batch arrivals at i.i.d. intervals and features Markovian routing and exponentially distributed service times. The system is shown to be stable, in the sense of not being overloaded, if and only if, for each node, the total arrival rate of external and internal customers is less than the service rate. The method
Borovkov, A. A., Schassberger, R.
openaire +2 more sources
A batch arrival queue with different vacations
Computers & Operations Research, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ho Woo Lee, Soon Seok Lee
openaire +3 more sources
Triggered Concurrent Batch Arrivals and Batch Departures in Queueing Networks
Discrete Event Dynamic Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chao, Xiuli, Zheng, Shaohui
openaire +4 more sources
Priority queues with batch Poisson arrivals
Operations Research Letters, 1991The paper studies batch arrival \(M^ x/G/1\) priority queues without and with (multiple or single) vacations. Applying the delay busy cycle analysis, it explicitly derives the Laplace-Stieltjes transforms and the first two moments of the waiting time distributions for the nonpreemptive (head-of-the-line) and preemptive resume priority queues ...
Hideaki Takagi, Yoshitaka Takahashi
openaire +1 more source
Numerical analysis of queues with batch arrivals
Performance Evaluation, 2000Summary: The steady state distribution of quasi-birth-death processes can be efficiently obtained by Matrix Geometric (MG) methods. Since a number of telecommunication problems are modelled by processes with batch arrivals, the extension of MG methods for these processes has practical importance.
György Wolfner, Miklós Telek
openaire +2 more sources
Maximum Matching in the Online Batch-Arrival Model
ACM Transactions on Algorithms, 2017Consider a two-stage matching problem, where edges of an input graph are revealed in two stages (batches) and in each stage we have to immediately and irrevocably extend our matching using the edges from that stage. The natural greedy algorithm is half competitive.
Euiwoong Lee, Sahil Singla 0001
openaire +1 more source