Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Wednesday, March 25, 2009 1:30 pm - 1:30 pm EDT (GMT -04:00)

AI seminar: Optimal scheduling of contract algorithms with soft deadlines

Speaker: Angele Hamel, Wilfrid Laurier University

A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupted throughout their execution, at which point they must report their current solution.

Speaker: Jesse Hoey, University of Dundee

In this talk, I will present a class of devices, called ePADs, for use by art therapists working with older adults with a progressive illness such as Alzheimer's disease.

Friday, May 1, 2009 11:30 am - 11:30 am EDT (GMT -04:00)

AI seminar: Active learning in regression over finite domains

Speaker: Casba Szepesvari, University of Alberta

It is known that the nonparametric minimax rate for regression in the active and passive settings are the same for various smoothness classes. In this talk, I will look into the simpler problem when the regression domain is finite, but the response variance is location dependent, i.e., the noise is heteroscedastic.

Thursday, July 9, 2009 11:00 am - 11:00 am EDT (GMT -04:00)

AI seminar: Overlapping coalition formation

Speaker: George Chalkiadakis, University of Southampton

In multiagent domains, agents form coalitions to perform tasks. The usual models of cooperative game theory assume that the desired outcome is either the grand coalition or a coalition structure that consists of disjoint coalitions (i.e., a partition of the set of agents).