Sciweavers

28888 search results - page 239 / 5778
» Computability and complexity in analysis
Sort
View
PERCOM
2005
ACM
16 years 6 months ago
Exploiting Information Relationships for Access Control
Pervasive computing environments offer a multitude of information services that provide potentially complex types of information. Therefore, when running access control for sensit...
Urs Hengartner, Peter Steenkiste
IPL
2007
69views more  IPL 2007»
15 years 6 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen
EDCC
1999
Springer
15 years 11 months ago
Dependability Modelling and Sensitivity Analysis of Scheduled Maintenance Systems
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...
Andrea Bondavalli, Ivan Mura, Kishor S. Trivedi