253 search results - page 46 / 51 » Endogenous Matching Functions: an Agent-Based Computational ... |
DAWAK
2001
Springer
13 years 12 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
WSDM
2012
ACM
12 years 2 months ago
2012
ACM
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...