O-RAID: a satellite constellation architecture for ultra-resilient global data backup. [PDF]
Meegama RGN.
europepmc +1 more source
Hybridized Charge-Transfer Window within a Fully Conjugated Multi-Resonance Thermally Activated Delayed Fluorescence Framework for Ultrafast Reverse Intersystem Crossing and High-Efficiency in Deep-Blue Organic Light-Emitting Diodes. [PDF]
Lee U, Jeong K, Kang S, Lee JY.
europepmc +1 more source
Accurate Inverse Design of Broadband Solar Metamaterial Absorbers via Joint Forward-Inverse Deep Learning. [PDF]
Wu Q, Deng Z, Zeng C, Cai H.
europepmc +1 more source
Numerical investigation of the impact of nonuniform corrosion on dynamic characteristics and nonlinear cyclic behaviour of circular RC bridge piers. [PDF]
Zhang Z +3 more
europepmc +1 more source
Metallic Oxides and the Overlooked Role of Bandwidth. [PDF]
Watkins AK, Cheetham AK, Seshadri R.
europepmc +1 more source
Gradient-Nested Organic/Inorganic Aerogels Achieve High Mechanical Strength and Feedback-Tunable Microwave Absorption. [PDF]
Liu X +6 more
europepmc +1 more source
Electrical and mechanical properties of conductive elastic bands as wearable sensors. [PDF]
Mustafa E +4 more
europepmc +1 more source
Related searches:
A variable neighborhood search approach for cyclic bandwidth sum problem
Knowledge-Based Systems, 2022In this paper, we tackle the Cyclic Bandwidth Sum Problem, consisting in minimizing the sum of the bandwidth of the edges of an input graph computed in a cycle-structured host graph. This problem has been widely studied in the literature due to its multiple real-world applications, such as circuit design, migration of telecommunication networks, or ...
Sergio Cavero +3 more
openaire +4 more sources
Improved Lower Bounds for the Cyclic Bandwidth Problem
Lecture Notes in Computer Science, 2021We study the classical Cyclic Bandwidth problem, an optimization problem which takes as input an undirected graph \(G=(V,E)\) with \(|V|=n\), and asks for a labeling \(\varphi \) of V in which every vertex v takes a unique value \(\varphi (v)\in [1;n]\), in such a way that \(B_c(G,\varphi )=\max \{\min _{uv\in E(G)}\{|\varphi (u)-\varphi (v)|,n ...
Déprés, Hugues +2 more
openaire +4 more sources

