Sciweavers

937 search results - page 80 / 188
» On the Complexity of Partial Order Properties
Sort
View
CSFW
2005
IEEE
15 years 11 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
DEXAW
1998
IEEE
94views Database» more  DEXAW 1998»
15 years 10 months ago
Towards Access Control for Logical Document Structures
This paper presents a first step towards a security model that defines access control for logical document structures. el benefits from roles to abstract from users and from secur...
Fredj Dridi, Gustaf Neumann
IJCAI
2007
15 years 7 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
EUROPLOP
2006
15 years 7 months ago
Patterns for Adaptive Service-Centric Systems
Service-centric systems are driven more and more towards self-adaptation in order to satisfy QoS in highly dynamic environments. However, the young age and immaturity of this doma...
Paris Avgeriou
AAAI
1998
15 years 7 months ago
Two Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula , if there...
Jérôme Lang, Pierre Marquis