Sciweavers

3016 search results - page 40 / 604
» The Online Transportation Problem
Sort
View
WWW
2008
ACM
14 years 10 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
13 years 11 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
CPC
2007
97views more  CPC 2007»
13 years 10 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
HICSS
2007
IEEE
139views Biometrics» more  HICSS 2007»
14 years 4 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 4 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