Sciweavers

274 search results - page 1 / 55
» Reducing truth-telling online mechanisms to online optimizat...
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 5 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
192
Voted
BROADNETS
2007
IEEE
15 years 11 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ML
1998
ACM
102views Machine Learning» more  ML 1998»
15 years 5 months ago
Statistical Mechanics of Online Learning of Drifting Concepts: A Variational Approach
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
Renato Vicente, Osame Kinouchi, Nestor Caticha
ML
2007
ACM
131views Machine Learning» more  ML 2007»
15 years 4 months ago
A primal-dual perspective of online learning algorithms
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
NETGAMES
2006
ACM
15 years 11 months ago
On correctness of scalable multi-server state replication in online games
Massively Multiplayer Online Games (MMOG) require novel, scalable network architectures for a high amount of participating players in huge game worlds. Consequently, new and compl...
Jens Müller 0004, Andreas Gössling, Serg...