365 search results - page 14 / 73 » Local Computation Schemes with Partially Ordered Preferences |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
In order to obtain semantic interoperability in open MultiAgent Systems, agents need to agree on the basis of different ontologies. In this paper we formally define mapping as cor...
IAT
2009
IEEE
14 years 3 months ago
2009
IEEE
—In decentralized settings with partial observability, agents can often benefit from communicating, but communication resources may be limited and costly. Current approaches ten...
MKWI
2008
13 years 10 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
EUROPAR
2009
Springer
14 years 1 months ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
CCS
2006
ACM
14 years 5 days ago
2006
ACM
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 ...