Sciweavers

2990 search results - page 229 / 598
» Hidden Markov processes
Sort
View
ICALP
2011
Springer
14 years 10 months ago
On the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Yuxin Deng, Matthew Hennessy
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
15 years 7 months ago
Convergence analysis of quantum-inspired genetic algorithms with the population of a single individual
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
Mehrshad Khosraviani, Saadat Pour-Mozafari, Mohamm...
CPC
2007
64views more  CPC 2007»
15 years 6 months ago
Sampling Regular Graphs and a Peer-to-Peer Network
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
Colin Cooper, Martin E. Dyer, Catherine S. Greenhi...
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
MMB
2010
Springer
153views Communications» more  MMB 2010»
15 years 8 months ago
The Total Overflow during a Busy Cycle in a Markov-Additive Finite Buffer System
We consider a finite buffer system where the buffer content moves in a Markov-additive way while it is strictly between the buffer boundaries. Upon reaching the upper boundary of t...
Lothar Breuer