277 search results - page 3 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
109
click to vote
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
114
click to vote
FLAIRS
2004
15 years 1 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
GECCO
2008
Springer
15 years 25 days ago
2008
Springer