Conseiller aux programmes d'études
Université de Montréal
Montréal, Quebec, Canada
miloszro at iro.umontreal.ca
À propos / About Me
Mes intérêts principaux sont les algorithmes, l'optimisation, les classements et la bioinformatique.
My main interests are algorithms, optimization, rankings and bioinformatics.
Me trouver / Find Me
We often use the average or the median of a list of numbers as a central tendency measure. Class grades are a common exemple. But what if you would like to have a median of ranked lists? The Median of Permutation Problem is a computer problem that consists to find a permutation (a ranked list) which is the closet to a set of permutations. It can be used to find a consensus between friend's preferences for an activity as it can be used to aggregate search engine results or bioinformatic data. In social theory, this problem is also known as the Kemeny-Young method and is used as a voting system with ranked candidates. Unfortunately (or fortunately!) this problem is NP-hard, meaning that no easy solution exists to solve this problem. Therefore, it's a beautiful challenge to explore this problem and find ways to tackle it.
lecturer IFT1015 A-2018
teacher assistant IFT1065 H-2017
teacher assistant IFT2125 H-2016
teacher assistant IFT2125 H-2014
Speciality in combinatorial optimization and algorithmics, FRQNT PhD and Mitacs Globalink scholarships, 5 months internship at LRI (U.Paris-Sud, France)
phd work
Speciality in bioinformatics, FRQNT Master scholarship, 1.5 month internship at LRI (U.Paris-Sud, France)
master work
CRSNG BRCP scholarships in 2012 and 2013
bachelor work
Code Phylogeny is a tool based on bioinformatics (sequence comparing) to spot similarities between works of students in a class. It's a small personal project linking bioinformatics and teaching... in bioinformatics!
I'm a year-round bike commuter.
I'm interested in Slackline/Highline (photos) as well as in acroyoga and climbing.