Results 261 to 270 of about 10,822,126 (305)
Some of the next articles are maybe not open access.
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 +2 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 +2 more sources
, 2020
In this paper, we considered a pentagonal fuzzy number to be performed through a single server system in a finite source queue model. The queue-based in a first come first served model.
R. Srinivasan +3 more
semanticscholar +1 more source
In this paper, we considered a pentagonal fuzzy number to be performed through a single server system in a finite source queue model. The queue-based in a first come first served model.
R. Srinivasan +3 more
semanticscholar +1 more source
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
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
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
An improved upper bound on the queuenumber of the hypercube
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hasunuma, Toru, Hirota, Misa
openaire +2 more sources
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pai K.-J., Chang J.-M., Wang Y.-L.
openaire +2 more sources
A Note on “An improved upper bound on the queuenumber of the hypercube”
Information Processing Letters, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pai, K.-J., Chang, J.-M., Wang, Y.-L.
openaire +2 more sources
On Queue-Length Information when Customers Travel to a Queue
Manufacturing and Service Operations Management, 2021Refael Hassin, Ricky Roet-Green
exaly