Results 291 to 300 of about 9,487,550 (311)
Some of the next articles are maybe not open access.
Planar Graphs of Bounded Degree Have Bounded Queue Number
SIAM Journal on Computing, 2019A queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, so that no two independent edges of the same queue are nested. The queue number of a graph is the minimum number of queues required by any of its queue layouts.
Bekos M. +6 more
openaire +6 more sources
A Finite Source Retrial Queue: Number of Retrials
Communications in Statistics - Theory and Methods, 2013We consider a single-server queuing system with a finite number of sources, where customers are not allowed to queue; instead of that, they make repeated attempts, or retrials, in order to enter service after some time. This queuing system and its variants are widely used to model disk memory systems, star-like local area networks, and other ...
V. Dragieva
openaire +3 more sources
Stack and queue number of 2-trees
International Computing and Combinatorics Conference, 1995We consider the two problems of embedding graphs in a minimum number of pages and ordering the vertices of graphs in the form of queue layouts. We show that the class of 2-trees requires 2-pages for a book embedding and 3-queues for a queue layout. The first result is new and the latter result extends known results on subclasses of planar graphs.
S. Rengarajan, C. E. Veni Madhavan
openaire +3 more sources
Three-Dimensional Graph Products with Unbounded Stack-Number
Discrete & Computational Geometry, 2022We prove that the stack-number of the strong product of three n -vertex paths is $$\Theta (n^{1/3})$$ Θ ( n 1 / 3 ) . The best previously known upper bound was O ( n ). No non-trivial lower bound was known.
D. Eppstein +5 more
semanticscholar +1 more source
Number of retrials in a Finite Source retrial Queue with Unreliable Server
Asia Pac. J. Oper. Res., 2014The object of this paper is to continue investigation of a single server retrial queue with finite number of sources in which the server is subjected to breakdowns and repairs.
V. Dragieva
semanticscholar +1 more source
Queue Length Estimation for Signalized Intersections Using License Plate Recognition Data
IEEE Intelligent Transportation Systems Magazine, 2019Queue length is an important variable in evaluating the performance of traffic management systems, especially under congested conditions. This problem has been studied in the literature based on different kinds of traffic sensors, such as loop detectors ...
Xiaoqin Luo +4 more
semanticscholar +1 more source
Bayesian inference and prediction in single server M/M/1 queuing model based on queue length
Communications in statistics. Simulation and computation, 2019This paper is concerned with the problem of estimating traffic intensity, ρ for single server queuing model in which inter-arrival and service times are exponentially distributed (Markovian) using data on queue size (number of customers present in the ...
Arpita Basak, Amit Choudhury
semanticscholar +1 more source
An N Server Cutoff Priority Queue Where Arriving Customers Request a Random Number of Servers
, 1989We consider a multi-priority, N-server, Poisson arrival, nonpreemptive queue, motivated by police applications. The number of servers requested by an arrival has a known priority dependent probability distribution.
Christian Schaack, R. Larson
semanticscholar +1 more source
Operational Research, 1966
A single-server queue with Poisson arrivals and exponential service is studied to obtain the joint probability distribution of the number in the system at time t and the cumulative number already served at time t.
H. Greenberg, I. Greenberg
semanticscholar +1 more source
A single-server queue with Poisson arrivals and exponential service is studied to obtain the joint probability distribution of the number in the system at time t and the cumulative number already served at time t.
H. Greenberg, I. Greenberg
semanticscholar +1 more source