The Virtual Math Teams (VMT) project investigates the innovative use of online collaborative environments to support effective mathematical problem-solving by small groups of lear...
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...