10666 search results - page 1985 / 2134 » Quantum programming languages |
132
Voted
CP
2003
Springer
15 years 8 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 ...
122
Voted
CP
2003
Springer
15 years 8 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...
126
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
118
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Mechanism design is the art of designing the rules of the game (aka. mechanism) so that a desirable outcome (according to a given objective) is reached despite the fact that each a...
112
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...