Sciweavers

5084 search results - page 664 / 1017
» Proving Possibility Properties
Sort
View
TARK
2007
Springer
16 years 27 days ago
Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
Thomas Ågotnes, Natasha Alechina
VLDB
2007
ACM
115views Database» more  VLDB 2007»
16 years 27 days ago
The Boundary Between Privacy and Utility in Data Publishing
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
Vibhor Rastogi, Sungho Hong, Dan Suciu
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
16 years 27 days ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 27 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
CCECE
2006
IEEE
16 years 26 days ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner