Sciweavers

564 search results - page 64 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
CORR
2007
Springer
74views Education» more  CORR 2007»
14 years 9 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
ECSQARU
2009
Springer
15 years 4 months ago
An Algorithm for Generating Arguments in Classical Predicate Logic
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con...
Vasiliki Efstathiou, Anthony Hunter
POLICY
2005
Springer
15 years 3 months ago
Obligation Policies: An Enforcement Platform
The use of policy-based mechanisms significantly reduces the complexity associated with applicational development and operation. In particular, history-based policies allow the s...
Pedro Gama, Paulo Ferreira
ECRTS
2009
IEEE
14 years 7 months ago
On-Line Scheduling Algorithm for the Gravitational Task Model
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
Raphael Guerra, Gerhard Fohler
CORR
2008
Springer
121views Education» more  CORR 2008»
14 years 10 months ago
Separability in the Ambient Logic
Abstract. The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semi...
Daniel Hirschkoff, Étienne Lozes, Davide Sa...