In: Algorithms, 2021, vol. 14, no. 9, p. 25
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with the issues. A CL is defined as a subset of all the edges linked to a given vertex such that it contains mainly edges that are believed to be...
|
Mémoire de bachelor : Haute Ecole de Gestion & Tourisme, 2021.
The purpose of this thesis is to create clusters from historical data with and without domain knowledge. The method used to cluster the data with domain knowledge is a pattern matching sequence and the method done without domain knowledge is a clustering algorithm that will be defined later. The data had to be retrieved from four old databases, then prepared to be clustered. A...
|
In: Advances in Computational Mathematics, 2015, vol. 41, no. 5, p. 1255-1288
|
In: Biomolecular NMR Assignments, 2015, vol. 9, no. 1, p. 7-14
|
In: Mathematical Programming, 2015, vol. 149, no. 1-2, p. 361-390
|
In: Journal of Biomolecular NMR, 2015, vol. 62, no. 4, p. 453-471
|
In: Journal of Biomolecular NMR, 2015, vol. 62, no. 1, p. 81-95
|
In: Journal of Biomolecular NMR, 2015, vol. 61, no. 3-4, p. 333-345
|
In: Journal of Biomolecular NMR, 2015, vol. 61, no. 1, p. 65-72
|
In: Journal of Computational Neuroscience, 2015, vol. 38, no. 3, p. 439-459
|