7006 search results - page 936 / 1402 » Approximation Algorithms |
191
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
194
click to vote
MP
2007
15 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
183
click to vote
SIGECOM
2006
ACM
16 years 25 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
197
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
221
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...