70 search results - page 5 / 14 » Dealing with Incomplete Preferences in Soft Constraint Probl... |
CP
2006
Springer
13 years 9 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
WECWIS
2006
IEEE
14 years 1 months ago
2006
IEEE
In a service-oriented e-commerce environment, it is a crucial task to help consumers choose desired products efficiently from a huge amount of dynamically configured product can...
IJCAI
2003
13 years 8 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...