Campus Event Calendar
Event Entry
What and Who
On the design of interruptible algorithms (and related problems in AI)
Spyros Angelopoulos
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 3, AG 5, SWS, AG 2, AG 4, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 5 December 2008
13:30
30 Minutes
E1 4
024
Saarbrücken
Abstract
Interruptible algorithms have the property that they can be interrupted at any point throughout their execution, at which point they must be able to report some partial (albeit not necessarily optimal) solution. On the other hand, the more stringent class of contract algorithms consists of algorithms whose running time is provided as part of their input. Such algorithms may very well fail to return any meaningful solution, if interrupted prior to their allotted execution time.
In this talk I will discuss black-box techniques for generating interruptible algorithms by means of schedules of contract-algorithm executions. This is a fundamental problem in artificial intelligence, with surprising connections to other well-known problems, such as parallel searching in concurrent rays.
Joint work with Alex Lopez-Ortiz and Angele Hamel.
Contact
Spyros Angelopoulos
--email hidden
passcode not visible
logged in users only
Spyros Angelopoulos, 11/30/2008 23:02
Spyros Angelopoulos, 11/30/2008 23:01 -- Created document.
Spyros Angelopoulos, 11/30/2008 23:01 -- Created document.