4036 search results - page 425 / 808 » Formal Methods |
154
click to vote
KCAP
2005
ACM
16 years 10 days ago
2005
ACM
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
173
click to vote
ICFCA
2005
Springer
16 years 9 days ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
190
click to vote
SAC
2003
ACM
16 years 1 days ago
2003
ACM
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are ...
183
click to vote
ATAL
2003
Springer
16 years 14 hour ago
2003
Springer
The problem investigated in this paper is the distribution of goals addressed to a group of rational agents. Those agents are characterized by their ability (i.e. what they can do...
215
click to vote
INTERACTION
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we present the core concept and the benefits of an approach called RoboEarth which will be highly beneficial for future robotic applications in science and industry...