Sciweavers

1206 search results - page 42 / 242
» Convergence analysis of online algorithms
Sort
View
ECCC
2010
80views more  ECCC 2010»
13 years 8 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
IPL
2008
61views more  IPL 2008»
13 years 8 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
COLT
2006
Springer
14 years 7 days ago
Online Learning Meets Optimization in the Dual
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
Shai Shalev-Shwartz, Yoram Singer
IQ
2007
13 years 10 months ago
When Interactive TV Meets Online Auction: A Study On Factors Affecting User Adoption
: This research has attempted to find the impact of information quality (IQ) and system quality (SQ) on users’ attitude to adopt the interactive TV based auction service. The pri...
Jaeheung Yoo, Imsook Ha, Junkyun Choi
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 9 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...