1206 search results - page 145 / 242 » Convergence analysis of online algorithms |
STACS
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
101
click to vote
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
Stochastic Flow Models (SFMs) are stochastic ystems that abstract the dynamics of complex discrete event systems involving the control of sharable resources. SFMs have been used to...
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
Supercomputers are prone to frequent faults that adversely affect their performance, reliability and functionality. System logs collected on these systems are a valuable resource o...
SIGECOM
2008
ACM
14 years 10 months ago
2008
ACM
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...