2116 search results - page 40 / 424 » On Probabilistic Alternating Simulations |
ICCD
2005
IEEE
14 years 7 months ago
2005
IEEE
Consideration of pairs of transition in probabilistic simulation allows power estimation for digital circuits in which inertial delays can filter glitches [5]. However, the merit ...
SIGMETRICS
2008
ACM
13 years 10 months ago
2008
ACM
Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout dynamically changing networks. We present an analysis of a gossip pro...
IJKESDP
2010
13 years 7 months ago
2010
Cognitive Agents must be able to decide their actions based on their recognized states. In general, learning mechanisms are equipped for such agents in order to realize intellgent ...
JAIR
2007
13 years 10 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
CONCUR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...