Sciweavers

476 search results - page 36 / 96
» The Complexity of Equality Constraint Languages
Sort
View
TCS
2011
14 years 6 months ago
Block insertion and deletion on trajectories
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel synta...
Bo Cui, Lila Kari, Shinnosuke Seki
ICALP
2000
Springer
15 years 3 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
IFIP
2000
Springer
15 years 3 months ago
Representing Human and Non-human Stakeholders: On Speaking with Authority
Information systems research is concerned with complex imbroglios of human and non-human components. As researchers, we need ways to represent the intricacies of the different sta...
Athanasia Pouloudi, Edgar A. Whitley
TRUSTBUS
2009
Springer
15 years 6 months ago
The OPL Access Control Policy Language
Abstract. Existing policy languages suffer from a limited ability of directly and elegantly expressing high-level access control principles such as history-based separation of dut...
Christopher Alm, Ruben Wolf, Joachim Posegga
ESAW
2006
Springer
15 years 3 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney