Sciweavers

6153 search results - page 76 / 1231
» Modeling Cyclic Change
Sort
View
AMAST
2010
Springer
14 years 11 months ago
Learning in a Changing World, an Algebraic Modal Logical Approach
Abstract. We develop an algebraic modal logic that combines epistemic and dynamic modalities with a view to modelling information acquisition (learning) by automated agents in a ch...
Prakash Panangaden, Mehrnoosh Sadrzadeh
ETFA
2008
IEEE
15 years 11 months ago
Reactivity analysis of different Networked Automation System architectures
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
Jürgen Greifeneder, Georg Frey
ASIACRYPT
2000
Springer
15 years 9 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson
JAIR
2008
138views more  JAIR 2008»
15 years 4 months ago
Networks of Influence Diagrams: A Formalism for Representing Agents' Beliefs and Decision-Making Processes
This paper presents Networks of Influence Diagrams (NID), a compact, natural and highly expressive language for reasoning about agents' beliefs and decision-making processes....
Ya'akov Gal, Avi Pfeffer
SIGMETRICS
2010
ACM
122views Hardware» more  SIGMETRICS 2010»
15 years 3 months ago
Heavy-traffic limits for nearly deterministic queues
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...
Karl Sigman, Ward Whitt