9051 search results - page 86 / 1811 » On detectability of stochastic systems |
168
click to vote
ITCC
2003
IEEE
16 years 1 days ago
2003
IEEE
Fractal objects like Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of s...
155
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract-- We introduce a distributed estimation algorithm for use by a collection of stochastically interacting agents. Each agent has both a discrete value and an estimate of the...
160
click to vote
SIGMETRICS
2005
ACM
16 years 10 days ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
156
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
194
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Empirical game theory allows studying the strategic interactions of agents in simulations. Specifically, traditional game theory describes such interactions by an analytical model...