Sciweavers

314 search results - page 39 / 63
» Goal Ordering in Partially Ordered Plans
Sort
View
CMOT
2006
146views more  CMOT 2006»
13 years 7 months ago
Normative KGP agents
We extend the logical model of agency known as the KGP model, to support agents with normative concepts, based on the roles an agent plays and the obligations and prohibitions tha...
Fariba Sadri, Kostas Stathis, Francesca Toni
PPOPP
2009
ACM
14 years 8 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
SIGECOM
2005
ACM
106views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
On decentralized incentive compatible mechanisms
Algorithmic Mechanism Design focuses on Dominant Strategy Implementations. The main positive results are the celebrated Vickrey-Clarke-Groves (VCG) mechanisms and computationally ...
Ahuva Mu'alem
ICTAI
2002
IEEE
14 years 15 days ago
Distributed Graphplan
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
CCS
2006
ACM
13 years 11 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...