Sciweavers

5214 search results - page 30 / 1043
» The Online Specialization Problem
Sort
View
HICSS
2007
IEEE
139views Biometrics» more  HICSS 2007»
14 years 1 months ago
Bridging and Persistence in Sustained, Collaborative Problem Solving Online
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...
Johann W. Sarmiento, Gerry Stahl
WSOM
2009
Springer
14 years 2 months ago
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
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 ...
Kai Labusch, Erhardt Barth, Thomas Martinetz
ECCC
2007
180views more  ECCC 2007»
13 years 7 months ago
Adaptive Algorithms for Online Decision Problems
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...
Elad Hazan, C. Seshadhri
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
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 ...
Nikhil R. Devenur, Thomas P. Hayes
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
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...
Shawn O'Neil, Amitabh Chaudhary