1450 search results - page 173 / 290 » On the Complexity of Hardness Amplification |
OWLED
2007
13 years 10 months ago
2007
: The mathematical nature of description logics has meant that domain experts find it hard to understand. This forms a significant impediment to the creation and adoption of ontolo...
SDL
2007
13 years 10 months ago
2007
Abstract. It is still the case that language descriptions have lots of semantic information captured using plain (English) text. These imprecise descriptions are hardly usable for ...
SEBD
2007
13 years 10 months ago
2007
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preference...
AAAI
2006
13 years 10 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
AAAI
2004
13 years 10 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...