A scalable scheduling and resource management framework for cloud-native B2B applications. [PDF]
Sci RepKomarasamy D +3 more
europepmc +1 more source
Research on cloud-edge-end distributed collaborative computing based on deep reinforcement learning. [PDF]
Sci RepWu C +5 more
europepmc +1 more source
Computation Offloading Strategy Based on Multi-Agent Reinforcement Learning in Vehicular Edge Computing Networks. [PDF]
Sensors (Basel)Liu Y, Sun Q, Liu Z.
europepmc +1 more source
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
BBR-n+ congestion control: Real-time performance with smart exit and advanced AQMs. [PDF]
PLoS OneAhsan M, Hussain M.
europepmc +1 more source
Real-time eco-driving strategy for intelligent connected vehicles under mixed traffic environments. [PDF]
iScienceFan 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
Related searches:
Stack and queue number of 2-trees
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 +1 more source
Planar Graphs of Bounded Degree Have Bounded Queue Number
SIAM Journal on Computing, 2019Summary: 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 +6 more
openaire +4 more sources
An improved upper bound on the queuenumber of the hypercube
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toru Hasunuma, Misa Hirota
openaire +2 more sources