Evènement pour le groupe Algorithmique Distribuée

Date 2016-05-09  14:00-15:00
TitreMajority population protocols 
RésuméWe start with the review of literature on majority population protocols. In the considered problem a large group of simple asynchronous entities, each associated with one of the two basic colours, is asked to decide which colour is attributed to the majority. Later we present some extensions of such protocols to different models and tasks. We also show how to amend majority protocols to report equality if neither of the original colours dominates the other in the population. Finally we consider populations with elevated diversity (with larger number of colours) and provide space efficient solutions to the absolute and relative majority problems.  
OrateurLeszek Gasieniec 
UrlUniversity of Liverpool 

Aucun document lié à cet événement.

Retour à l'index