27 search results - page 2 / 6 » Partial Matchmaking for complex Product and Service Descript... |
AGENTS
2000
Springer
13 years 9 months ago
2000
Springer
In an agent-based system, where different agents form dynamic associations for the purposes of collaborative processing, agents must be able to locate other agents that can provi...
DAWAK
2001
Springer
13 years 9 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
DLOG
2004
13 years 6 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
BXML
2004
13 years 6 months ago
2004
: The system presented in this paper shows an alternative solution for the communication problem in virtual teams. Although it does not address the full bandwidth of tasks of an gr...
MFDBS
1991
13 years 8 months ago
1991
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...