13026 search results - page 2441 / 2606 » Creativity and Artificial Intelligence |
149
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
181
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
149
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
176
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
164
click to vote
CP
2003
Springer
15 years 12 months 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...