Sciweavers

554 search results - page 37 / 111
» Approximate Probabilistic Model Checking
Sort
View
KESAMSTA
2009
Springer
15 years 4 months ago
An Approximate Model for Bidders in Sequential Automated Auctions
In this paper, we propose a probabilistic model to study the interaction of bidder and seller agents in sequential automated auctions. We consider a designated “special bidder”...
Erol Gelenbe, Kumaara Velan
87
Voted
QEST
2005
IEEE
15 years 3 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha
98
Voted
QEST
2007
IEEE
15 years 3 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
ATAL
2010
Springer
14 years 10 months ago
Strategic planning for probabilistic games with incomplete information
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
Henning Schnoor
109
Voted
AAAI
2011
13 years 9 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos