573 search results - page 92 / 115 » Planning as Satisfiability with Preferences |
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
GROUP
2005
ACM
14 years 1 months ago
2005
ACM
Recent proliferation of computing devices has brought attention to heterogeneous collaborative systems, where key challenges arise from the resource limitations and disparities. S...
W4A
2005
ACM
14 years 1 months ago
2005
ACM
The need for providing learners with web-based learning content that match their accessibility needs and preferences, as well as providing ways to match learning content to userâ€...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
PVLDB
2010
13 years 2 months ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...