Results 251 to 260 of about 6,187,768 (281)

D3PG-Light: A Lightweight and Stable Resource Scheduling Framework for UAV-Integrated Sensing, Communication, and Computation Systems. [PDF]

Sensors (Basel)
Cheng Q, Wu W, Zhou Y.
europepmc   +1 more source

Real-time eco-driving strategy for intelligent connected vehicles under mixed traffic environments. [PDF]

iScience
Fan L, Cai Y, Zhou B, Wei H, Feng B.
europepmc   +1 more source

Lossless Compression of Large Field-of-View Infrared Video Based on Transform Domain Hybrid Prediction. [PDF]

Sensors (Basel)
Liu Y, Zhang R, Zhang Y, Chen Y.
europepmc   +1 more source

Planar Graphs of Bounded Degree Have Bounded Queue Number

SIAM Journal on Computing, 2019
Summary: A \textit{queue layout} of a graph consists of a \textit{linear order} of its vertices and a partition of its edges into \textit{queues}, so that no two independent edges of the same queue are nested. The \textit{queue number} of a graph is the minimum number of queues required by any of its queue layouts. A long-standing conjecture by \textit{
Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt   +6 more
openaire   +3 more sources

Stack and queue number of 2-trees

, 1995
We 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

Some of the next articles are maybe not open access.

Related searches:

An improved upper bound on the queuenumber of the hypercube

Information Processing Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toru Hasunuma, Misa Hirota
openaire   +2 more sources

A Note on “An improved upper bound on the queuenumber of the hypercube”

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang   +2 more
openaire   +2 more sources

Upper bounds on the queuenumber of k-ary n-cubes

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang   +2 more
openaire   +2 more sources

A Finite Source Retrial Queue: Number of Retrials

Communications in Statistics - Theory and Methods, 2013
We 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 ...
openaire   +1 more source