Results 221 to 230 of about 182,746 (274)

Rapidly Progressive and Relapsing Myelitis With Human T Lymphotropic Virus Type 1: A Case Report and Review of the Literature. [PDF]

Neurol Neuroimmunol Neuroinflamm
Morrison AA, Samudralwar RD, Berger JR.
europepmc   +1 more source

Transseptal Device Comparison for Improved Puncture and Streamlined Mitral Edge-To-Edge Repair. [PDF]

J Soc Cardiovasc Angiogr Interv
Malek AEI, Singhal M, Soliman W, Al-Dujaili S, Al-Khalaf M, Okeson B, Carbajal C, Yim S, Boyatt J, Lerner D, Shenoda M, Aragon J.   +11 more
europepmc   +1 more source

Effects of intraspecies and interspecies competition on genetic device construction and performance. [PDF]

mSphere
Thompson S, Williams AR, Dill V, Marshall D, Sawyer E, Alexander M, Rahn-Lee L, Shih JD-C.   +7 more
europepmc   +1 more source

Exploring the Role of Tamarind Seed Polysaccharides in Modulating the Structural, Digestive, and Emulsion Stability Properties of Waxy Corn Starch Composites. [PDF]

Foods
Ya X, Ma Y, Song Z, Jiang Y, Guo C, Yi J.   +5 more
europepmc   +1 more source

One-pot CRISPR-based point of care platform for rapid, specific and sensitive detection of HPV 16 without pre-amplification. [PDF]

Microsyst Nanoeng
Chen Y, Chen Y, Zhang C, Cai Y, Zeng Z, Reboud J, Cooper JM, Shan H, Wang Y, Xu G.   +9 more
europepmc   +1 more source

A Novel Low Right Atrial-approach Transseptal Puncture Technique for Large-bore Deflectable Sheaths: Enhancing Control, Precision, and Safety. [PDF]

J Innov Card Rhythm Manag
Kloosterman EM.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

HAM/TSP

Nature Reviews Disease Primers, 2015
exaly   +3 more sources

Discounted Reward TSP

Algorithmica, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farbstein, Boaz, Levin, Asaf
openaire   +2 more sources

Deadline TSP

Theoretical Computer Science, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boaz Farbstein, Asaf Levin
openaire   +1 more source

Polynomial Reduction of TSP to Freely Open-loop TSP

2019 2nd International Conference of the IEEE Nigeria Computer Chapter (NigeriaComputConf), 2019
Travelling Salesman Problem (TSP) is one of the earliest combinatorial problem that is identified to be NP-hard problem. It is a problem that seeks to find the shortest possible route in a graph problem which passes through all nodes only once and return to the starting point. A variant of TSP is the Freely Open-loop TSP (FOTSP) which seeks to find the
Muhammad Bashir Abdulrazaq, Yusuf Suleiman Tahir, Suleiman Sha’aban, Muhammed Sani Jibia   +3 more
openaire   +1 more source