Sciweavers

1120 search results - page 48 / 224
» Eager Markov Chains
Sort
View
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
15 years 6 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
TACAS
2007
Springer
136views Algorithms» more  TACAS 2007»
15 years 6 months ago
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
This paper studies the effect of bisimulation minimisation in model checking of monolithic discrete-time and continuous-time Markov chains as well as variants thereof with rewards...
Joost-Pieter Katoen, Tim Kemna, Ivan S. Zapreev, D...
LCN
2002
IEEE
15 years 4 months ago
On Modeling the Packet Error Statistics in Bursty Channels
Wireless channels usually face bursty errors, i.e., errors are prone to occur in clusters. These bit errors can be modeled using the Gilbert-Elliott model. When data packets are t...
Changli Jiao, Loren Schwiebert, Bin Xu
ICALP
2000
Springer
15 years 3 months ago
Amalgamation of Transition Sequences in the PEPA Formalism
This report presents a formal approach to reducing sequences in PEPA components. Performing the described amalgamation procedure we may remove, from the underlying Markov chain, t...
Jane Hillston, J. Tomasik
ICML
2010
IEEE
15 years 27 days ago
Finite-Sample Analysis of LSTD
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
Alessandro Lazaric, Mohammad Ghavamzadeh, Ré...