163 search results - page 32 / 33 » An Introduction to Probabilistic Automata |
111
click to vote
PE
2011
Springer
14 years 4 months ago
2011
Springer
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
QEST
2010
IEEE
14 years 7 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
86
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...
EUROCRYPT
2004
Springer
15 years 2 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...