Sciweavers

47 search results - page 9 / 10
» Using opponent models for efficient negotiation
Sort
View
ISCI
2010
146views more  ISCI 2010»
13 years 4 months ago
Simulatable certificateless two-party authenticated key agreement protocol
Key agreement (KA) allows two or more users to negotiate a secret session key among them over an open network. Authenticated key agreement (AKA) is a KA protocol enhanced to preve...
Lei Zhang 0009, Futai Zhang, Qianhong Wu, Josep Do...
RULEML
2010
Springer
13 years 5 months ago
A Contract Agreement Policy-Based Workflow Methodology for Agents Interacting in the Semantic Web
The Semantic Web aims at automating Web content understanding and user request satisfaction. Intelligent agents assist towards this by performing complex actions on behalf of their...
Kalliopi Kravari, Grammati-Eirini Kastori, Nick Ba...
PCI
2005
Springer
14 years 29 days ago
A Graphical Rule Authoring Tool for Defeasible Reasoning in the Semantic Web
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
Nick Bassiliades, Efstratios Kontopoulos, Grigoris...
AAAI
1994
13 years 8 months ago
Exploiting Meta-Level information in a Distributed Scheduling System
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...
Daniel E. Neiman, David W. Hildum, Victor R. Lesse...
EUROCRYPT
2009
Springer
14 years 8 months ago
Asymmetric Group Key Agreement
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
Qianhong Wu, Yi Mu, Willy Susilo, Bo Qin, Josep Do...