1456 search results - page 39 / 292 » Preference Modelling |
MDM
2007
Springer
15 years 6 months ago
2007
Springer
Personalization systems exploit preferences for providing users with only relevant data from the huge volume of information that is currently available. We consider preferences th...
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
107
click to vote
AMAI
2005
Springer
14 years 11 months ago
2005
Springer
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...