Thursday, November 3, 2022

Legend

Read a detailed explanation.

Round	Eliminated	Winners
Round 1
Round 2	suboptimal multi-objective heuristic search
Round 3	complexity of time-dependent shortest paths	bayesian filtering for location estimation

Candidate	What changed	Current total votes
bayesian filtering for location estimation	1 votes in the first round	25.0% 1 votes
scalable rail planning	1 votes in the first round	25.0% 1 votes
complexity of time-dependent shortest paths	1 votes in the first round	25.0% 1 votes
suboptimal multi-objective heuristic search	1 votes in the first round	25.0% 1 votes

Candidate	What changed	Current total votes
bayesian filtering for location estimation	Gained 1 votes	50.0% 2 votes
scalable rail planning		25.0% 1 votes
complexity of time-dependent shortest paths		25.0% 1 votes
suboptimal multi-objective heuristic search	Eliminated: 1 votes redistributed to remaining candidates or became inactive

Candidate	What changed	Current total votes
bayesian filtering for location estimation	Elected: Gained 1 votes	75.0% 3 votes
scalable rail planning		25.0% 1 votes
complexity of time-dependent shortest paths	Eliminated: 1 votes redistributed to remaining candidates or became inactive

Round	What changed	Current total votes
Round 1	1.0 first-round votes.	25.0% 1 votes
Round 2	Gained 1 votes from suboptimal multi-objective heuristic search.	50.0% 2 votes
Round 3	Elected. Gained 1 votes from complexity of time-dependent shortest paths.	75.0% 3 votes

Round	What changed	Current total votes
Round 1	1.0 first-round votes.	25.0% 1 votes
Round 2	Eliminated.	25.0% 1 votes

Round	What changed	Current total votes
Round 1	1.0 first-round votes. Eliminated.	25.0% 1 votes

Candidate name	Round 1	Round 2	Round 3
bayesian filtering for location estimation	25.0% 1 votes	50.0% 2 votes	75.0% 3 votes
scalable rail planning	25.0% 1 votes	25.0% 1 votes	25.0% 1 votes
complexity of time-dependent shortest paths	25.0% 1 votes	25.0% 1 votes
suboptimal multi-objective heuristic search	25.0% 1 votes