BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250807T163403EDT-40814P1VzO@132.216.98.100
DTSTAMP:20250807T203403Z
DESCRIPTION:Applying a parallel algorithm for clustering network data.\n\nI
 n this talk\, we present diverse concepts: Variable Neighborhood Search\, 
 Variable Neighborhood Descent\, parallel algorithm\, shared memory\, messa
 ge 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.\n
DTSTART:20180504T173000Z
DTEND:20180504T183000Z
LOCATION:Room PK-4323\, CA\, QC\, Montreal\, H2X 2Y7\, 201 Ave. President-K
 ennedy
SUMMARY:Églantine Camby\, HEC Montréal
URL:/mathstat/channels/event/eglantine-camby-hec-montr
 eal-286863
END:VEVENT
END:VCALENDAR