AAAI
2010
13 years 6 months ago
2010
AAAI
2010
13 years 6 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
AAAI
2010
13 years 6 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
AAAI
2010
13 years 6 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
AAAI
2010
13 years 6 months ago
2010
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
AAAI
2010
13 years 6 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
AAAI
2010
13 years 6 months ago
2010
Online forums contain valuable human-generated information. End-users looking for information would like to find only those threads in forums where relevant information is present...
AAAI
2010
13 years 6 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
AAAI
2010
13 years 6 months ago
2010
AAAI
2010
13 years 6 months ago
2010
Machine learning and data mining have become aware that using constraints when learning patterns and rules can be very useful. To this end, a large number of special purpose syste...