2116 search results - page 174 / 424 » On Probabilistic Alternating Simulations |
130
click to vote
QEST
2008
IEEE
15 years 10 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
112
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
—In this paper we compare and enhance the three prevailing approaches of IEEE 802.11e Performance analysis. Specifically, the first model utilizes a Markov Chain to describe th...
151
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Broadcast operation, which disseminates information network-wide, is very important in multi-hop wireless networks. Due to the broadcast nature of wireless media, not a...
169
click to vote
GLVLSI
2006
IEEE
15 years 10 months ago
2006
IEEE
As CMOS devices and operating voltages are scaled down, noise and defective devices will impact the reliability of digital circuits. Probabilistic computing compatible with CMOS o...
120
click to vote
QEST
2006
IEEE
15 years 10 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...