Sciweavers

1382 search results - page 29 / 277
» Formal Analysis of Online Algorithms
Sort
View
163
Voted
ECCC
2010
80views more  ECCC 2010»
15 years 5 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»
15 years 5 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
15 years 9 months 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
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
15 years 7 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...
ICASSP
2008
IEEE
16 years 5 days ago
Stability analysis of the consensus-based distributed LMS algorithm
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
Ioannis D. Schizas, Gonzalo Mateos, Georgios B. Gi...