3758 search results - page 189 / 752 » A Complete Subsumption Algorithm |
HOTOS
2003
IEEE
15 years 3 months ago
2003
IEEE
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...
81
Voted
CP
2003
Springer
15 years 3 months ago
2003
Springer
A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
ECRTS
2002
IEEE
15 years 3 months ago
2002
IEEE
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
91
Voted
COCO
2008
Springer
15 years 2 hour ago
2008
Springer
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
84
Voted
IJCAI
2007
14 years 11 months ago
2007
In order to evaluate ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results with some reference. The most prominent comparis...