Results 51 to 60 of about 62,282 (304)
TSP with neighborhoods of varying size [PDF]
Summary: In TSP with Neighborhoods (TSPN) we are given a collection \(\mathcal S\) of regions in the plane, called neighborhoods, and we seek the shortest tour that visits all neighborhoods. Until now constant-factor approximation algorithms have been known only for cases where the neighborhoods are of approximately the same size.
Mark de Berg +5 more
openaire +6 more sources
PD‐1 Inhibits CD4+ TRM‐Mediated cDC1 Mobilization via Suppressing JAML in Human NSCLC
CD4+ tissue‐resident memory T cells (TRMs) in non‐small cell lung cancer recruit conventional type 1 dendritic cells via XCL1‐XCR1 signaling, orchestrating antitumor immunity. The costimulatory molecule JAML is essential for this process. PD‐1 blockade restores JAML expression and cDC1 mobilization, while JAML agonists synergize with anti‐PD‐1 therapy,
Zheyu Shao +16 more
wiley +1 more source
An ant colony genetic fusion routing algorithm based on soft define network
Abstract Aiming at the problem that there are many paths in data forwarding in soft define network (SDN) network, and the optimal path is difficult to find, combined with the advantages of ant colony algorithm and Genetic algorithm (GA), a routing control strategy based on the ant colony genetic fusion algorithm is proposed.
Kaixin Zhao, Yong Wei, Yang Zhang
wiley +1 more source
Voltage Synthesis of Multiple Uniform PWM Generated by Step Builder Functions
The paper considers a problem pertaining to synthesis and qualitative assessment of a harmonic voltage composition of multiple uniform PWM pulses generated by step builder functions.
A. G. Stryzhniou, H. V. Lednik
doaj
Parameterized Approximation Algorithms for TSP [PDF]
We study the Traveling Salesman problem (TSP), where given a complete undirected graph G = (V,E) with n vertices and an edge cost function c:E↦R_{⩾0}, the goal is to find a minimum-cost cycle visiting every vertex exactly once.
Guo, Jiong, Zhou, Jianqi, Li, Peihua
core +1 more source
New inapproximability bounds for TSP [PDF]
In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP) and prove new explicit inapproximability bounds for that problem. The best up to now known hardness of approximation bounds were 185/184 for the symmetric case (due to Lampis) and 117/116 for the asymmetric case (due to Papadimitriou and Vempala).
Marek Karpinski +2 more
openaire +3 more sources
Mesenchymal stromal cells (MSCs) show promise for treating immune‐related disorders through immunomodulation and tissue regeneration. This review gives a brief overview of current clinical approval of MSC therapies. It also discussed how bioengineering, including genetic modification, biomaterial delivery, extracellular vesicles, and iPSC‐derived MSCs,
Sichen Yang +6 more
wiley +1 more source
Videoamplifier with matched connecting impedances
The results of the logical-heuristic synthesis, development and laboratory tests of a video amplifier with a large dynamic range for the matched receiving paths of radio systems are presented.
I. Yu. Malevich, D. A. Solonovich
doaj
The action spectrum of a tailored azobenzene is shifted toward bio‐optical window through the chemical modification of its singlet and triplet energy levels. Consequently, the bidirectional photo‐switching of azobenzene in physiological conditions is achieved when excited by red and far‐red light, which offers greater tissue penetration.
Mila Miroshnichenko +11 more
wiley +1 more source
Non-Linearities of Complicated Lever Mechanisms of Electric and Hydraulic Drives
The paper determines conversion coefficients for mechanical transmissions of electric and hydraulic drives which are used in special equipment. Nonlinearities of conversion coefficients for mechanical transmissions have been revealed in the paper ...
A. G. Strizhnev, A. N. Rusakovich
doaj

