808 search results - page 59 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
146
click to vote
CP
2011
Springer
13 years 9 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
CP
2005
Springer
15 years 3 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
106
click to vote
TON
2008
14 years 9 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
IJCAI
1993
14 years 11 months ago
1993
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...