Sciweavers

1523 search results - page 169 / 305
» Partially ordered secretaries
Sort
View
AMAST
2006
Springer
15 years 9 months ago
Realizability Criteria for Compositional MSC
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic spec...
Arjan J. Mooij, Judi Romijn, Wieger Wesselink
CCS
2006
ACM
15 years 9 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...
FAABS
2004
Springer
15 years 9 months ago
Formal Consistency Verification of Deliberative Agents with Respect to Communication Protocols
The aim of this paper is to show a method that is able to detect inconsistencies in the reasoning carried out by a deliberative agent. The agent is supposed to be provided with a h...
Jaime Ramírez, Angélica de Antonio
DEXA
2006
Springer
118views Database» more  DEXA 2006»
15 years 9 months ago
Using an Oracle Repository to Accelerate XPath Queries
One of the problems associated with XML databases is the poor performance of XPath queries. Although this has attracted much attention by the research community, solutions are eith...
Colm Noonan, Cian Durrigan, Mark Roantree
ECAI
2006
Springer
15 years 9 months ago
Enhancing Constraints Manipulation in Semiring-Based Formalisms
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
Stefano Bistarelli, Fabio Gadducci