Date(s): Thursday, March 19
Time: 2:30 pm - 4:00 pm
Location: : Abbotsford Campus
Time: 2:30 pm - 4:00 pm
Time: 2:30 pm - 4:00 pm
Location: : Abbotsford Campus
When: Thurs March 19, 2:30-4 pm
Where: A310, Abbotsford Campus
Abstract: In my talk I will present several randomized graph-based algorithms. The first algorithm is a random walk process on a graph. Here we analyse the so-called cover time of the process. The second algorithm comes from the area of game theory. The task of the selfish agents is to distribute their tasks over a set of servers. The goal of every agent is to allocate his own task to a server with minimum load. The last process is a so-called voting process which spreads opinions in a network.
Event Location : Abbotsford Campus
Map UnavailableAnalysis of Randomized Algorithms: a talk by Petra Berenbrink
Date(s): Thursday, March 19Time: 2:30 pm - 4:00 pm