Event
Églantine Camby, HEC Montréal
Friday, May 4, 2018 13:30to14:30
Room PK-4323, 201 Ave. President-Kennedy, Montreal, QC, H2X 2Y7, CA
Applying a parallel algorithm for clustering network data.
In this talk, we present diverse concepts: Variable Neighborhood Search, Variable Neighborhood Descent, parallel algorithm, shared memory, message passing interface and community detection. Besides, we explain how can we use all of them in only one algorithm. Some numerical results will be discussed at the end.