Results 21 to 30 of about 9,487,550 (311)
RANCANG BANGUN SISTEM NOMER ANTRIAN BERBASIS INTERNET OF THINGS (IOT)
Queuing is a phenomenon that we can encounter anywhere and anytime, such as queuing to get food orders, ticketing services, and so on. However, unfortunately not everyone likes to queue, especially queuing for public agency services.
I Made Agus Chandra Wijaya+1 more
doaj +1 more source
Stack and queue numbers of graphs revisited
A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmovi\'c and Wood in 2005, was ``half-answered'' by Dujmovi\'c, Eppstein, Hickingbotham, Morin and Wood in 2022; they proved the existence of a graph family with the queue number at most $4$ but unbounded stack number.
Petr Hliněný, Adam Straka
openaire +2 more sources
On Linear Layouts of Graphs [PDF]
In a total order of the vertices of a graph, two edges with no endpoint in common can be \emphcrossing, \emphnested, or \emphdisjoint. A \emphk-stack (respectively, \emphk-queue, \emphk-arch) \emphlayout of a graph consists of a total order of the ...
Vida Dujmović, David R. Wood
doaj +1 more source
Fishing vessel queue model in Kutaraja Fishing Port: Case study of Wharf Pias II [PDF]
Kutaraja international Fishing Port is one of the biggest port with highest activity in Aceh Province. Nevertheless, when unloading process, fishing vessel often occur long queue of fishing vessel.
Rahayu Rosi+3 more
doaj +1 more source
Parameterized Algorithms for Queue Layouts [PDF]
An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ queues, such that no two independent edges of the same queue nest.
S. Bhore+3 more
semanticscholar +1 more source
Distributed Queuing in Dynamic Networks [PDF]
We consider the problem of forming a distributed queue in the adversarial dynamic network model of Kuhn, Lynch, and Oshman (STOC 2010) in which the network topology changes from round to round but the network stays connected.
Gokarna Sharma, Costas Busch
doaj +1 more source
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao+6 more
wiley +1 more source
Graph classes and forbidden patterns on three vertices [PDF]
This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs.
Feuilloley, Laurent, Habib, Michel
core +1 more source
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg+27 more
core +3 more sources
Queue is the density or the number of customer waiting. However, the density of customers will also lead to the loss of potential customers. In this study, the aim of this research is to determine the queuing discipline applied by Mc Donald’s Galuh Mas ...
Siti Nurrohmah+2 more
doaj +1 more source