BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T022129Z
UID:Seminar-dept-351@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20140520T160000
DTEND:20140520T170000
SUMMARY:School Seminar Series
DESCRIPTION:Dr Matthias Englert: Reordering Buffer Management\n\nIn a classical online problem arriving requests have to processed immediately and in order of arrival. In some applications on the other hand, it is possible to temporarily store arriving sequences in a fixed sized buffer before processing. Only when the buffer is full, the algorithm is forced to decide which request from the buffer to process (and how).\n\n\n\nWe will discuss problems with this property and analyze them. In particular we will talk about a model in which a colored items, which arrive one by one, have to be grouped together according to their color to minimize cost.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=351
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR