Results 41 to 50 of about 129,100 (297)
This work presents the Network Assisted Routing and Allocation Algorithm (NARA), a routing and allocation algorithm for device-to-device (D2D) communication in 5G cellular architectures.
BASTOS, A. V. +2 more
doaj +1 more source
Effectiveness of Network Interdiction Strategies to Limit Contagion During a Pandemic
COVID-19 is an infectious disease that has been declared a global public health emergency by the World Health Organization. Besides claiming over 3 million lives worldwide, COVID-19 led to unprecedented disruption in industrial productivity, trading, and
Satyaki Roy +2 more
doaj +1 more source
Trees in greedy colorings of hypergraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gyárfás, András, Lehel, Jenő
openaire +2 more sources
Third case of the Cyclic Coloring Conjecture [PDF]
The Cyclic Coloring Conjecture asserts that the vertices of every plane graph with maximum face size D can be colored using at most 3D/2 colors in such a way that no face is incident with two vertices of the same color. The Cyclic Coloring Conjecture has
Hebdige, Michael, Kral, Daniel
core +2 more sources
Scalable partitioning for parallel position based dynamics [PDF]
We introduce a practical partitioning technique designed for parallelizing Position Based Dynamics, and exploiting the ubiquitous multi-core processors present in current commodity GPUs.
Fratarcangeli, M., Pellacini, Fabio
core +2 more sources
An algorithm for optimal network planning and frequency channel assignment in indoor WLANs [PDF]
The increased use of wireless local area networks has led to an increased interference and a reduced performance, as a high amount of access points are often operating on the same frequency channel.
Joseph, Wout +3 more
core +1 more source
Complexity of Grundy coloring and its variants
The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of GRUNDY COLORING, the problem of determining whether a given graph has ...
Bonnet, Edouard +3 more
core +3 more sources
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds.
Fischer, Manuela +2 more
core +1 more source
Layout Decomposition for Quadruple Patterning Lithography and Beyond
For next-generation technology nodes, multiple patterning lithography (MPL) has emerged as a key solution, e.g., triple patterning lithography (TPL) for 14/11nm, and quadruple patterning lithography (QPL) for sub-10nm. In this paper, we propose a generic
Pan, David Z., Yu, Bei
core +1 more source
Tandem VHH targeting distinct EGFR epitopes were engineered into a monovalent bispecific antibody (7D12‐EGA1‐Fc) with more potent ADCC without increasing affinity to EGFR. Structural modeling of 7D12‐EGA1‐Fc showed cross‐linking of separate EGFR domains to enhance CD16a engagement on NK cells.
Yuqiang Xu +5 more
wiley +1 more source

