Data Structures and Algorithms

1910 Submissions

[2] viXra:1910.0534 [pdf] submitted on 2019-10-26 11:37:24

Problème du Voyageur de Commerce TSP

Authors: Ayoub Abraich
Comments: 13 Pages.

The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
Category: Data Structures and Algorithms

[1] viXra:1910.0107 [pdf] submitted on 2019-10-08 09:34:58

A Short Communication on Exploring – [ MRI Scans With Sparse Tensors based on Mir-Library/D Language/IoT/HPC Heterogeneous Environments ]

Authors: Nirmal Tej Kumar
Comments: 6 Pages. Short Communication & Technical Notes

An Interesting Suggestion+Review on Using Sparse Tensors as Information Processing Tools in the Context of Probing Mathematical Algorithms for Next Generation Medical Image Processing R&D based on [ D lang/Mir-Library Modules/IoT/HPC/LLVM/LDC ] - High Performance Computing in Heterogeneous [ Linux/Windows/Other OS ]Environments.
Category: Data Structures and Algorithms