257 search results - page 15 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
CP
1997
Springer
15 years 1 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
115
click to vote
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
ANOR
2011
14 years 4 months ago
2011
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
74
Voted
AAAI
1996
14 years 11 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...