55 search results - page 5 / 11 » cp 2003 |
CP
2003
Springer
14 years 25 days ago
2003
Springer
This paper presents two methods for improving the performance of the Distributed Breakout Algorithm using the notion of interchangeability. In particular, we use neighborhood part...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. Constraint programming offers powerful problem solving capabilities, but experienced and skilled developers are needed to maximise the benefits it offers. We introduce...
CP
2003
Springer
14 years 25 days ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...